+0  
 
0
23
1
avatar

In how many ways can you distribute 10 indistinguishable balls among 8 distinguishable boxes, if at least one of the boxes must be empty?

 Jan 16, 2023
 #1
avatar+12 
0

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}\).

 Jan 16, 2023
edited by EquationEnthusiast  Jan 16, 2023

42 Online Users