People enter a restaurant and check their hat at the coat check, but since the worker is new, he makes the mistake of throwing all the hats in a pile. When the patrons return to claim their hats at the end of the evening, the worker gives each person a random hat from the pile.
1. What is the probability that no one receives their own hat back if there are only 2guests?
2. What is the probability that no one receives their own hat back if there are 3 guests?
3. What is the probability that no one receives their own hat back if there are 4 guests?
4. What is the probability that no one receives their own hat back if there are 8 guests?
5.What is the probability that no one receives their own hat back if there are 10 guests?
To solve, build a systematic method. For example, one way you could do it is by defining several events, where P_i = the number of ways of a person i to recive their hat correctly, and then the number of ways that at least one person to recive their hat is the union of P_1,...,P_n; finally, you can count this using inclusion/exlusion, then count the complement to finish the problem.
People enter a restaurant and check their hat at the coat check, but since the worker is new, he makes the mistake of throwing all the hats in a pile. When the patrons return to claim their hats at the end of the evening, the worker gives each person a random hat from the pile.
1. What is the probability that no one receives their own hat back if there are only 2guests?
2. What is the probability that no one receives their own hat back if there are 3 guests?
3. What is the probability that no one receives their own hat back if there are 4 guests?
4. What is the probability that no one receives their own hat back if there are 8 guests?
5.What is the probability that no one receives their own hat back if there are 10 guests?
To solve, build a systematic method. For example, one way you could do it is by defining several events, where P_i = the number of ways of a person i to recive their hat correctly, and then the number of ways that at least one person to recive their hat is the union of P_1,...,P_n; finally, you can count this using inclusion/exlusion, then count the complement to finish the problem.
