A , A , A , A , A , B , B , B , B , C , C , C , D , D
How many total selections of 5 letters from the above 1 4 letters are possible ?
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
Do you know its proof? From where did you learn this?
Log in to reply
Log in to reply
ok!thanx! BTW from where did you come to know about that juggler's problem,or did you make it yourself?and did you know about that formula which you used?
Log in to reply
@Adarsh Kumar – The juggler problem was from my fiitjee book. the question had me lost for about half an hour and after that when i solved it i found the problem interesting so i posted it. the formula that i used, i came up with it while solving the problem.
Why isn't the answer 1 4 5 ?
Easy question did it the same way....
I Made 6 simple cases
Case 1. All 5 Alike = 1 way
Case 2. 4 Alike 1 Different = 2*3 = 6 ways
Case3. 3 Alike 2 Different = 3*3 = 9 ways
Case 4. 2 Alike 3 different = 4*1 = 4 ways
Case 5. 2 Alike 2 Alike 1 Different = 6*2 = 12 ways
Case 6. 3 Alike 2 Alike = 3*3 = 9 ways
Problem Loading...
Note Loading...
Set Loading...
If there are m items of one kind, n items of another kind and so on, then the number of ways of selecting r things is given by
the coefficient of x r in the expansion of :
( 1 + x + x 2 + x 3 . . . . . x m ) ( 1 + x + x 2 + x 3 . . . . . x n ) . . . . . . . . .
Applying this here gives us coefficient of x 5 as 4 1