Question
Larry, Michael, and Doug have five donuts to share. If any one of the men can be given any whole number of donuts from 0 to 5, in how many different ways can the donuts be distributed?
(A) 21
(B) 42
(C) 120
(D) 504
(E) 5040
In the solution I very much like the approach of treating the 5 donuts and 2 dividers as 7 objects leading to the solution of 7! / (2! * 5!) = 21
However, my question is, how could you manipulate that short-cut if the problem stated that each man, had to have at least 1 donut (ie, 1-3 as opposed to 0-5)?
My guess is, since each man has to have at least 1 donut, that leaves only 2 donuts to work with, and 2 dividers, so answer is 4! / (2! * 2!) = 6
Is that right?