In how many ways can you distribute 10 indistinguishable boxed among 8 distinuishable boxes, if at least one of the boxes must be empty?
Give this a try !
[10 + 8 - 1] C [8 - 1] ==17 C 7 ==19,448 ways - this is based on the assumption that ALL distributions are equally likely, including counting of empty boxes.
