Each of balls is randomly placed into one of bins. Which of the following is closest to the probability that each of the bins will contain an odd number of balls?
- A)
- B)
- C)
- D)
- E)
Answer
E
Key insight
Track only whether all three bin parities agree; each ball flips one parity, giving p_{k+1} = (1 - p_k)/3, which converges to 1/4.
Solution
Only the parities of the three bin counts matter, and each ball flips the parity of the bin it lands in. After balls the three parities sum to the parity of , so after an odd number of balls the pattern is either "all odd" or "one odd, two even."
Call the pattern same when all three parities agree (all odd after an odd number of balls, all even after an even number) and split otherwise. Adding one ball moves a same pattern to split for sure, and moves a split pattern back to same with probability (the ball must land in the single bin whose parity differs).
Let be the probability of same after balls. Then
The fixed point is , and , so the error shrinks by a factor of every ball: . For this is minus something astronomically small.
The answer is .
Why this works
Reducing each bin to its parity turns outcomes into a tiny state machine, and symmetry among the bins collapses it to two states. A random process that mixes (every state can reach every other) settles to its stationary distribution, here uniform over the four parity patterns allowed by an odd total, hence . "Closest to" is the cue that a limit, not an exact value, is wanted.
Alternative approach
Heuristic: for large the parities of bin and bin are each odd with probability about and are nearly independent, and bin is then odd automatically because the total is odd. So the probability is about .
The trap
Treating the three parities as independent coin flips or guessing 1/3, instead of noticing the odd total leaves four (nearly) equally likely parity patterns.
Common mistakes
- Treating the three parities as independent coin flips or guessing 1/3, instead of noticing the odd total leaves four (nearly) equally likely parity patterns.
- Forgetting the constraint from the odd total, which makes "all even" impossible and leaves four, not eight, patterns to share the probability.
Techniques
Use an invariant, parity, or coloring argument · Define states/recurrence and iterate · Exploit symmetry to reduce work or pair up objects