This is a follow-up to this question: Probability of empty bin, where the number of balls is based on another game...
The question is: We flip a fair coin until we obtain our first heads. If the first heads occurs on the kth flip, we are given k balls. We put them into 3 bins labeled 1, 2, and 3 at random. Find the probability that none of the three bins are empty.
In the spirit of answering this question, I want to find the probability that $n$ balls, when placed into 3 bins, will be placed in such a way that no bin is empty? I decided to go down a combinatorics-based route:
You can enumerate the balls as $b_1 ... b_n$
You have $n$ balls, out of which you first choose 3 -> $^nC_3$
You place these three balls into three bins -> 3!
The remaining $n-3$ balls are placed -> $3^{n-3}$
There are a total of $3^n$ possible ways to place n balls into 3 bins.
It's obvious to me this is wrong. It works for the case where we have 3 balls, but as soon as we hit $n=5$ balls, the numerator is bigger than the denominator. But I really can't tell where I have gone wrong here.
When I attempted the original problem, I first tried the stars and bars method to determine the probability of three bins not being empty. However, you can't do that because not every possibility that you get from stars and bars has the same probability. That's why I thought that I had to enumerate the balls - it worked for the case of three balls ($\frac{6}{27}$).
– Abhay Agarwal May 25 '24 at 19:13