shrey2287 wrote: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
This is a partition problem.
Consider the arrangement of two 1's and five zeros(1100000).
Here the zeros symbolize doughnuts.
Let us describe the arrangement as: Larry gets the zeros or doughnuts to the left of the first 1, Michael gets the zeros between the two 1's and Doug gets the zeros after the second 1.
So, 0000011 means that Larry gets the five doughnuts and Michael and Doug get none.
Similarly, 0100100 means that Larry gets 1 doughnut, Michael gets 2 and Doug gets 2.
So the total number ways of arranging 2 ones and 5 zeros will give us the required answer.
This is 7!/(2!*5!) = 21
The correct answer is
A.