Each of balls is independently placed into one of boxes, with all boxes equally likely. What is the probability that exactly one box is empty?
Yes, I am well aware that the solution has been posted. While they make sense to me, I have an incorrect solution that I can't seem to point out how it's wrong.
Here is my logic for the numerator:
- We have $n$ ways to choose an empty bin
- Exactly 1 ball will contribute to an already non-empty box (making that box have 2 balls instead of 1). There are $n$ ways to choose the ball, and $n - 1$ ways to choose the box.
- For the remaining $n - 1$ balls, there are $(n - 1)!$ ways to permute them across the $n - 1$ boxes, to guarantee that all the boxes are nonempty.
The numerator simplifies to $n(n - 1)n!$. Comparing with the correct solution of $\binom{n}{2} \cdot n!$, I am overcounting by a factor of 2. Could someone explain to me how?