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 (\(\text{i.e. each son gets at least one logo}\)) .

**Details and Assumptions**:

Note that each of the logo is **Distinct** .

×

Problem Loading...

Note Loading...

Set Loading...