Single correct option
The number of ways to distribute identical sweets among children so that every child gets at least sweet and no child gets more than sweets is
- A.
- B.
- C.
- D.
Show answer and solution
Answer: (C)
Let be the sweets of child and put , so and . Without the upper bound the count is . Now remove the cases where some : write , so , which has solutions, and there are choices of the child. Two children cannot both have since , so there is no overlap to add back. The answer is .
Saved on this device. Sign in or create a free account to keep it on every device.