In how many ways can you distribute 10 indistinguishable balls among 8 distinguishable boxes, if at least one of the boxes must be empty?
Here is my attempt:
[10 + 8 - 1] C [8 - 1] == 17 C 7 ==19,448 - number of ways including the count of empty boxes.
