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
Three draws are needed exactly when the first two chips add to 4 or less, which only happens for the pairs 1 and 2 or 1 and 3.
Solution
Three draws are needed when the first two chips do not yet add to more than , and the third chip then pushes the total over .
1. Which first two chips add to or less? Two different chips from to :
- (at most )
- (at most )
- every other pair, like or , is already more than .
So only the pairs and keep the drawing going.
2. Does the third draw always stop it? After the total is and the smallest chip left is , giving at least . After the total is and the smallest chip left is , giving at least . So yes, the third draw always finishes.
3. Count. The first two chips form one of pairs, all equally likely. Two of them work, so the probability is
The answer is .
Why this works
"Exactly three draws" means "not finished after two, finished after three." Here the second part always happens, so the whole question becomes counting pairs with a small sum. Just be sure the favorable cases and the total are counted the same way (both as pairs, or both in order).
Alternative approach
Count in order. The first two draws can happen in orders. The good ones are , , , , which is orders. The probability is .
The trap
Mixing ways of counting: listing only 2 favorable pairs but dividing by the 20 ordered draws, which gives 1/10.
Concise 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 .
Review in the AoPS books
- Introduction to Counting & Probability, Chapter 7: Introduction to Probability
- Prealgebra, Chapter 15: Problem-Solving Strategies (§15.2)
- Introduction to Counting & Probability, Chapter 8: Basic Probability Techniques
Techniques
Organized listing / direct enumeration