Stars and bars with upper bound

Asked Dec 18 '12 at 14:43

Active Dec 18 '12 at 14:43

Viewed 82 times

Possible Duplicate:
How can I determine the number of unique hands of size H for a given deck of cards?

There are n chocolates and k students. How many ways can it be distributed so that each student receives no more than m chocolates?

Assume that m<=n

edited Apr 13 '17 at 12:20

Community

asked Dec 18 '12 at 14:43

AIB

1

This answer to another old question gives more explanation of the formula arrived at in the question to which I linked above. – Brian M. Scott Dec 18 '12 at 14:47
1

@BrianM.Scott I think that it would not be so bad to have the answer written for this question because it has the "right" level of generality for the problem. – Phira Dec 18 '12 at 16:21

0 Answers0