So I've been able to find answers on here as to how to distribute
n identical objects between
r parties by applying the following formula:
C( n+r-1, r-1)
However, this is only for the case where each of the parties can have x objects, where
0 ≤ x ≤ n.
How does this formula change when there is a minimum requirement for each party?
For example, I have 10 identical balls to distribute to 4 unique students. Each student must receive at least 1 ball. How many ways can I distribute the balls?
How would I solve that?