A box contains red balls, green balls, yellow balls, blue balls, white balls, and black balls. What is the minimum number of balls that must be drawn from the box without replacement to guarantee that at least balls of a single color will be drawn
- A)
- B)
- C)
- D)
- E)
Answer
B
Key insight
Worst case: draw 14 of each color that has at least 14 balls and every ball of the small colors, 75 in all; the next ball forces a 15th.
Solution
Ask how many balls can be drawn while avoiding of any one color. Each color can contribute at most balls, but a color with fewer than balls can only contribute all of them:
- red, green, yellow: each, total ;
- blue , white , black : total .
So balls can be drawn with no color reaching . This is the maximum such draw, so once balls are drawn, some color must appear at least times (the only colors with room to grow are red, green and yellow, and one of them gets a th ball).
The answer is .
Why this works
"Guarantee" problems are pigeonhole arguments: find the largest draw that fails, then add one. The extremal (worst) case fills every color to its cap, where the cap is the smaller of and the number of balls of that color. The distractor is what you get by ignoring the second cap.
The trap
Using 14 for every color (6 times 14 = 84) even though blue, white and black have fewer than 14 balls.
Common mistakes
- Using 14 for every color (6 times 14 = 84) even though blue, white and black have fewer than 14 balls.
- Reporting , the largest failing draw, instead of , the first draw that guarantees success.
Techniques
Consider the largest/smallest element or boundary case · Pigeonhole principle