A box contains chips, numbered and . Chips are drawn randomly one at a time without replacement until the sum of the values drawn exceeds . What is the probability that draws are required?
- A)
- B)
- C)
- D)
- E)
Answer
D
Key insight
Exactly three draws happen when the first two chips sum to at most 4, which means the unordered pair is {1,2} or {1,3}: 2 of 10 pairs.
Solution
Three draws are required exactly when the first two draws do not already exceed , but the third draw does.
Two distinct chips from sum to at most only for the pairs (sum ) and (sum ). In either case the smallest remaining chip is at least , so the third draw pushes the total past automatically. Hence "three draws" is the same event as "the first two chips are or ."
There are equally likely unordered pairs for the first two chips, and of them work:
The answer is .
Why this works
A stopping-time question is usually easiest to phrase as a condition on the first few draws: "stops at step 3" means "not stopped by step 2, stopped by step 3." Here the second half of the condition is automatic, so the whole problem collapses to counting pairs with a small sum.
Alternative approach
Ordered draws: the first two chips can be drawn in ordered ways, and the favorable orders are , giving again.
The trap
Forgetting that the third draw is then automatic, or counting only one order of the pair while using all 20 ordered pairs as the total.
Common mistakes
- Forgetting that the third draw is then automatic, or counting only one order of the pair while using all 20 ordered pairs as the total.
- Including the pair or (sum ), which already exceeds after two draws.
Techniques
Organized listing / direct enumeration