Sn = 1.1!+2.2!+3.3!............+n.n!

Sn = Here r.r! = (r+1)r! - r! = (r+1)! - r! Thus Sn = = = [2! + 3! + ... + (n+1) ! ] - [1! + 2! + ... + n! ]

or Sn = 2! - 1! + (n + 1)! = (n+1)! + 1

[1] Problem #14 on p. 145: Suppose that K is a proper subgroup of H, and H is a proper subgroup of G. If |K| = 42 and |G| = 420, what are the possible orders of H? By Lagrange's Theorem, we know |K| divides |H|, so |H| = 42k for some k (bigger than 1 since K is a proper subgroup of H). Likewise, 42k divides 420, so k divides 420/42 = 10. Since H is a proper subgroup of G, we know k < 10, so either k = 2 or k = 5, and hence either |H| = 2(42) = 84, or |H| = 5(42) = 210.

how many symmetric functions possible with n boolean variables? symmetric functions:permutation of i/p doesnot change its functionality ex:f(x,y)=x y =y x then fun is symmetric.. symmetric relations : 2^(n*(n+1)/2).
Symmetric Functions : 2^(n+1)

Probability of occurance of 6th head at 10th toss of a fair coin is a) (1/2)x10 b)(1/2)^9 x C(9,5) c)(1/2)^10 x C(9,5) d)1/2
C) Out of first 9 tosses we need 5 heads. So from binomial distribution 9C5(1/2)^5 * (1/2)^4. and for 10th toss, 6th head : 1/2. so totally : 9C5 (1/2)^10

b) Its a theorem meenakshi joshi... Waise u can check dat by making graphs also when u use n edges, there is a possibility that the graph may be disconnected but when we use minimum (n-1)(n2)/2+1, its always sure that graph is connected. It is because make K4 (complete graph) .. n for 5th vertices left it..so 7 minimum is required..

#ONTO Functions when n>m (r=1 to n) (-1)^n-r nCr r^m #ONTO Functions when n=m n! or m!

C????????????????????????

see in complete bipartite when length of cycle 4 occurs when twice you go to one group to another.... and possible on m >=2 m = 2 me 1 cycle hogi.....cz 2*2 = 4 so bipartite graphs are always in terms of /2 #perfect matchings =( (2n) ! ) / (2^n * n! )

A and B are friends.they decide to meet between 1PM and 2pm ON A GIVEN DAY.there is a condition that whoever arrives first will not wait for the other for more than 15min.the probability that they will meet on that day. A)1/4

B)1/16 C)7/16 D)9/16 LET G BE A complete undirected graph on 6 vertces. IF the VERTICES G are labbelld, then the number of disntict cycles of lenght 4 in G is equal to 15 30 90 360
6c4 * 3! Or P(6,4)/2

A complete n - ary tree is a tree in which each node has a child or no children. Let I be the number of internal nodes and l be the number of leaves in a complete n-ary tree. If l = 41, and I = 10, then calculate the value of n.
L = I(n-1)+1, substitute and get the answer L- leaves, I internal nodes ...

select T\F ??? 1. every hamiltonian graph contains no cut-vertex. 2. every hamiltonian digraph is strongly connected. 3. every hamiltonian bipartite graph is an equally bipartite graph.
TTT

how many binary search trees are possible with 15 distinct nodes 1,2,3,...,15 such that in all those BST'S 5 is a root and 10 is a root of right subdivision? A)1000 B)8000 C)8232 D)NONE

how many binary search trees are possible with 15 distinct nodes 1,2,3,...,15 such that in all those BST'S 5 is a root and 10 is a root of right subdivision? A)1000 B)8000 C)8232 D)NONE

Number of trees using n nodes(say T(n)) = (2n)!/[(n+1)!*n!]. According to que. 1). there can be 4 elements in the left subtree(i.e. 1to4) 2). there can be 4 elements on the left subtree routed at 10(i.e. 6to9) 3). there can be 5 elements on the right subtree routed at 10(i.e. 11to15). So total no of trees = T(4)*T(4)*T(5) = 14*14*42=8232

there are 4 special cases .. E = 0 , M = 0 ---> Exacy zero value is represented E = 255 , M=0----> infinity value can be represented E=0 , M<> 0 ------> denormalized number E=255, M<>0------> Not a number special case for special kind of errors like divide by zero or complex numbers...... remember that 255 can vary according to size excpt these cases normal number can be represented....

no of relations : on set with three elements Akif Khan by the way u used please check and correct . i always face problems....correct if any is wrong .. or add if m missing something...any combination :) reflexive :- 2^6 symmetric : - 2^3 * 2^3C2 Antysymmetric :- 2^3 * 3^(3C2) transitive :- dunt know since we have to process matrix before finding this.. still a guess ... irreflexive- 2^6 reflexive and symetric :- 2^3C2 antysymetric and symmetric :- 2 ^ 3C2

Prateek Gupta and Akif Khan like this.

Hima Mehta ya asyymetric reh gaya 3^3C2 4 hours ago Like

Akif Khan Hima Mehta, I think it wud be as, Reflexive and irreflexive -2^((n^2)-n) And for antisymmetric and symmetric, only diagonal elements= 2^n And everything else u mentioned sounds good....... 4 hours ago via mobile Like 1

Madhav Purohit Hima Mehta:Total no of relations possible would be 2^(n*n) Now refleclive and irrefleclive partition the set in 2 equal size set refleclive=irrefleclive=2^(n*(n-1)) for symmentric, if v tk tuple (x,y) we must take tuple (y,x), 1 cn look at it as undirected graph with n nodes as (x,y) -->(y,x) so in graph with n nodes v hv n(n+1)/2 edges(note self loop is allowed) and we cn include or exclude each edge so total combinations=2^(n(n+1)/2) for antisymmetric=2^n*3^(n(n-1)/2 for asymmetric 3^(n(n-1)/2)

Akif Khan bhai: amend or add 3 hours ago Like 3

Akif Khan Madhav Purohit, sahi hain Bhai 3 hours ago via mobile Like

Hima Mehta Madhav Purohit yeah i have above formulas...even m using them only.. was unable to get combinations of two of them... now i think m comfortable with it .... thanks both of you Akif Khanyeah for antysymetric and symmetric it is 2^n ..and for reflexive and irrreflexive i have simplified it using 2^((n^2 )- n) == 2^n(n-1) only.. about an hour ago Like

Akriti Arora plz mention formulas for their combinations also ... about an hour ago Like

Hima Mehta Akriti Arora you have to make that by seeing graph or matrix pattern about an hour ago Like

Two cards are drawn at random from a well-shuffled deck of 52 cards with replacement. What is the probability that both cards are of the same suit ? a. (1/16) b. (1/4) c. (1/8) d. 4 a)