SOLUTION: Each person attending a party brings a prize. If there are n people and therefore n prizes, where anyone can get any number of prizes, how many ways can the prizes be distributed s
Algebra ->
Permutations
-> SOLUTION: Each person attending a party brings a prize. If there are n people and therefore n prizes, where anyone can get any number of prizes, how many ways can the prizes be distributed s
Log On
Question 1067974: Each person attending a party brings a prize. If there are n people and therefore n prizes, where anyone can get any number of prizes, how many ways can the prizes be distributed so that no one leaves with the prizes he/she brought?
(a) Solve this problem using inclusion/exclusion
(b) There is a much easier solution. What is it?
(c) Use binomial theorem to explain why both answers are the same. Answer by ikleyn(52781) (Show Source):
