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
Only odd or even matters for each bin. Track one question, 'do all three bins match?', ball by ball. The chance quickly settles at 1/4.
Solution
balls is far too many to handle directly, so watch what happens one ball at a time, keeping track only of whether each bin holds an odd or an even number.
1. Each ball flips one bin. When a ball lands in a bin, that bin switches from odd to even or from even to odd. The other two bins stay the same.
2. Two kinds of situations. Call the situation matched if all three bins are odd, or all three are even. Call it unmatched otherwise (two bins agree and one is different).
After balls the total is odd, so "all even" is impossible; "matched" then means exactly "all three odd", which is what we want.
3. How one more ball changes things.
- From matched, the ball flips one bin, so the three no longer agree. Matched always becomes unmatched.
- From unmatched, there is one "odd one out" bin. The situation becomes matched only if the ball lands in that bin, a chance of .
4. The rule. Let be the chance of "matched" after some number of balls. After one more ball, the chance is
because we must be unmatched first (chance ) and then hit the right bin (chance ).
5. Run it. After ball, one bin has a ball and two are empty, so .
| balls | ||||||
|---|---|---|---|---|---|---|
| decimal |
- Where it settles. The values bounce above and below and get closer every step. In fact is the value that stays put: . Each step, the distance from shrinks to a third of what it was, so after balls the chance is extremely close to .
The answer is .
Why this works
Keeping only "odd or even" for each bin shrinks a huge number of outcomes down to two situations, matched and unmatched. A step-by-step rule like "new " settles down to the value that the rule leaves unchanged, and here that value is . The words "closest to" hint that you want where the chance settles, not an exact fraction.
Alternative approach
A quick estimate. With so many balls, bin is odd about half the time and bin is odd about half the time, and the two hardly affect each other. Once bins and are known, bin is decided, because the total is odd: if bins and are both odd, their sum is even, so bin is odd. So the chance is about
The trap
Guessing 1/3, or treating the three bins as three separate coin flips (1/8), without noticing the third bin is decided by the other two.
Concise 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 .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 8: Basic Probability Techniques (§8.5)
- Introduction to Number Theory, Chapter 1: Integers: The Basics
- Intermediate Counting & Probability, Chapter 10: Recursion
- Introduction to Algebra, Chapter 22: Special Manipulations (§22.3)
Techniques
Use an invariant, parity, or coloring argument · Define states/recurrence and iterate · Exploit symmetry to reduce work or pair up objects