I am really stuck in this probability-related problem which is stated as follows:
You have $n$ people, each one with a different ID card (so a total of $n$ cards) and they put them in a box. Then each one takes an ID card from the box without putting it back (so without replacement) until the box becomes empty. We say that if a person picked his own ID card a success. Let us denote as $X$ the random variable which represents the number of such successes. We have to find the expected value and the variance of $X$.
Up until now, I have reached these conclusions:
- Let us denote: $X_i=
\begin{cases}
1, & \text{if $i$ person finds his ID card} \\
0, & \text{if otherwise}
\end{cases}$, so we get that $X=\sum_{i=1}^n X_i$ and $E[X]=E[\sum_{i=1}^n X_i]=\sum_{i=1}^n E[X_i]=\sum_{i=1}^nP[X_i=1]$. It all comes down to find $P[X_i=1]$ which I believe is this: $P[X_i=1]=P(\forall j
- The above way of finding $P[X_i=1]$ also introduces some concept of ordering in the picking process (the $i$-th person picks after $1,2,...,i-1$ have already picked and while the rest have not) which I don't know if its right or not.
- I saw some connection with the hypergeometric distribution, but couldn't get something substantial out of it, based on the fact that I could find the expected value using the probability mass function: $E[X]=\sum_{i=0}^n xP[X=x]$ . I am pretty sure though that the probability to have $n$ successes is $P[X=n]=\prod_{i=0}^{n-1} 1/(n-i)$.
- I may looking at it the wrong way! Any ideas?