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

Consider the matching problem, Example 5m, and define AN to be the number of ways in which the 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!.

AN = (N 1)(AN-1+ AN-2)

Step by Step Solution

3.41 Rating (164 Votes )

There are 3 Steps involved in it

1 Expert Approved Answer
Step: 1 Unlock

The formula AN N1AN1AN2 follows from the principle of inclusionexclusion Lets consider the number of ways the men can select their hats such that at l... View full answer

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 A First Course In Probability Questions!