Number of ways of distributing 6 different prizes to 3 boys named Utsav , Calvin and Satvik . Such that no boy is left empty . Otherwise he will cry . ^_^
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.
Well, this is a nice easy problem!
Suppose that one person gets 4 prizes(the maximum one can get).
Then, he can have ( 6 4 ) combinations of prizes. Also, the other 2 can have ( 2 1 ) combinations of prizes for each combination, which means there are ( 6 4 ) ( 2 1 ) combinations for 4 prizes for one guy. But there are three so, in total 3 ( 6 4 ) ( 2 1 ) combinations.
Similarly, we can find for 3 for one guy and 2 for one guy too such that when we add all of them, we get this-
3 [ ( 6 4 ) ( 2 1 ) + ( 6 3 ) ( 3 2 ) 2 + ( 6 2 ) 2 ] which is simply 5 4 0