Chapter 5: Problem 392
The number of five digit number that can be formed by using \(1,2,3\) only, such that exactly three digit of the formed numbers are same is (a) 30 (b) 60 (c) 90 (d) 120
Chapter 5: Problem 392
The number of five digit number that can be formed by using \(1,2,3\) only, such that exactly three digit of the formed numbers are same is (a) 30 (b) 60 (c) 90 (d) 120
All the tools & learning materials you need for study success - in one app.
Get started for freeA student is to answer 10 out of 13 questions in an examination such that he must choose at least 4 from the first five questions. The number of choice available to him is (a) 140 (b) 196 (c) 180 (d) 346
The number of ways of distributing 52 cards among four players so that three players have 17 cards each and the fourth player has just one card is (a) \(\left[(52 !) /(17 !)^{3}\right]\) (b) \(52 !\) (c) \((17 !)\) (d) \(\left[(52 !) /(17 !)^{2}\right]\)
A man has 7 relative, 4 of them ladies and 3 gentlemen. His wife also have 7 relatives. 3 of them ladies and 4 gentlemen, They invite for a dinner partly 3 ladies and 3 gentlemen so that there are 3 of the men's relative and 3 of the wife's relative. The number of ways of invitation is (a) 854 (b) 585 (c) 485 (d) 548
If \(a_{n}={ }^{n} \sum_{r=0}\left[1 /\left({ }^{\mathrm{r}} \mathrm{C}_{\mathrm{n}}\right)\right]\), then \(^{\mathrm{n}} \sum_{\mathrm{r}=0}\left[\mathrm{r} /\left({ }^{\mathrm{r}} \mathrm{C}_{\mathrm{n}}\right)\right]\) equals (a) \((\mathrm{n}-1) \mathrm{a}_{\mathrm{n}}\) (b) n \(\mathrm{a}_{\mathrm{n}}\) (c) \((1 / 2) \mathrm{n} \mathrm{a}_{\mathrm{n}}\) (d) None of these
Nandan gives dinner party to six guests. The number of ways in which they may be selected from ten friends if two of the friends will not attend the party together is: (a) 112 (b) 140 (c) 164 (d) 146
What do you think about this solution?
We value your feedback to improve our textbook solutions.