Final bid to brilliant!
A man has 5 Brilliant logos (of different colours) and had to distribute it among his three sons. Find the total number of ways in which these 5 logos can be distributed among his three sons so that no son gets angry ( ) .
Details and Assumptions :
Note that each of the logo is Distinct .
The answer is 150.
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.
1 solution
Use Principle of inclusion and exclusion . I leave it up to you to solve. Hint: Let there be 3 sets A,B,C for three sons. Let U be universal set in which you'll count the possibilities of empty ones. Then subtract from U , A U B U C. For more go to distinct objects into distinct bins