Assuming each of the 5 donuts are Identical, we are distributing 5 identical items to 3 distinct “groups” of people (L, M, and D)
It does not matter which donuts each person gets - only the number of donuts matters in terms of producing a unique distribution.
Any person can receive 0 donuts or all the donuts. All 5 donuts will be distributed in each arrangement.
We can set up a Linear equation as:
L + M + D = 5
Where L , M, and D are all greater than or equal to >/= 0
We can look at the number of unique arrangements visually by placing Partitions between each Variable and drawing out 5 donuts:
* | * * | * *
In order to divide the identical donuts among the 3 people, we need 2 partitions
In the above visual representation:
L = 1 donut
M = 2 donuts
D = 2 donuts
We can move the 2 partitions around to show all the unique possibilities, for example:
| | * * * * *
L = 0 ——- M = 0 ——- D = All 5
Or
* * | * * * |
L = 2—- M = 3 ——- D = 0
The number of unique distributions will be given by the number of way to Arrange and “shuffle around” the 7 elements: of which we have 2 identical petitions and 5 identical stars representing the donuts.
We can do this in: (7 c 2) ways or
7! / (2! * 5!) =
(7 * 6 ) / 2 =
21 unique distributions
Posted from my mobile device