Question: 17. Consider the matching problem, Example 5m, and define A N to be the number of ways in which the N men can select their

17. Consider the matching problem, Example 5m, and define AN to be the number of ways in which the N men can select their hats so that no man selects his own. Argue that AN = (N - 1)(AN-1 + AN-2)

This formula, along with the boundary conditions A1 = 0, A2 = 1, can then be solved for AN, and the desired probability of no matches would be AN/N!.

HINT: After the first man selects a hat that is not his own, there remain N - 1 men to select among a set of N - 1 hats that does not contain the hat of one of these men. Thus there is one extra man and one extra hat. Argue that we can get no matches either with the extra man selecting the extra hat or with the extra man not selecting the extra hat.

Step by Step Solution

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock blur-text-image
Question Has Been Solved by an Expert!

Get step-by-step solutions from verified subject matter experts

Step: 2 Unlock
Step: 3 Unlock

Students Have Also Explored These Related Theory Of Probability Questions!