The matching problem in a recursive view

64 Views Asked by At

Suppose there are n people invited to a party. Seats are assigned and a name card is made for each guest. However, floral arrangements on the table unexpectedly obscure the name cards. When the n guests arrive, they seat themselves randomly. Show that the probability that no one seats at the assigned seats, $P_n = \frac{n-1}{n} P_{n-1} + \frac1n P_{n-2}$.

My thoughts: $P_n = P(\text{n-1 people didn't sit at there assigned seats & the n-th person didn't sit at her assigned seat}) = P_{n-1} \times \frac{n-1}{n}$. But my thoughts are obviously incorrect. I'm just confused about why there would be a $P_{n-2}$ term. Could someone give me some hints? Thank you

2

There are 2 best solutions below

0
On

Instead of considering full table try to consider emty table. We have two cases. First guest seats on place numbered $i$, next comes guest numbered $i$. He can seat on first place or other. If seats on place numered $1$. Then we have the problem reduced to $n-2@ places

In second case guest neither seats on $i$ and $1$. Still $n-1$ guests and $n-1$ places to seat.

0
On

The probability that no one sits at the right seat will be that $1$ person will sit in the $n-1$ places that do not belong to them, and the next person will sit in the $n-1-1=n-2$ that do not belong to them, and so on. This should a sufficient enough hint to help you with the question!