In Example 2h, say that i and j, i ≠ j, form a matched pair if i chooses the hat belonging to j and j chooses the hat belonging to i. Find the expected number of matched pairs.
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.