In how many ways can you distribute 10 indistinguishable balls among 8 distinguishable boxes, if at least one of the boxes must be empty?
+12 Hint: the number of ways to distribute \(n\) indistinguishable balls into \(k\) distinguishable boxes is found with the binomial coefficient \(\binom{n + k - 1}{n}\).
