1993 AHSME Problems/Problem 24
Problem
A box contains shiny pennies and dull pennies. One by one, pennies are drawn at random from the box and not replaced. If the probability is that it will take more than four draws until the third shiny penny appears and is in lowest terms, then
Solution
First let’s try to find the number of possible unique combinations. I’ll denote shiny coins as 1 and dull coins as 0.
Now, each configuration can be represented by a string of 1s and 0s e.g. 0110100. Notice that a combination can be uniquely determined solely by the placement of their 0s OR 1s e.g. 1 - - 1 1 - - where the dashes can be replaced by 0s. This makes the number of unique combinations 7 choose 3 (if you’re counting w.r.t. shiny coins) OR 7 choose 4 (w.r.t dull coins). Both are equal to 35.
Next, observe that, for the event that the third shiny coin is not within your first 4 picks, it has to be within the last three numbers. You can think of this as placing the seven coins in a vertical stack in the box and shuffling that stack randomly. Then, to pick, you extract the first coin on the top and keep repeating. It has the same effect.
The sequence can have 1 shiny coin in the last 3 digits (Case 1), 2 shiny coins in the last 3 digits (Case 2) or 3 shiny coin in the last three digits (Case 3).
Case 1: Let’s start with the first case of one shiny coin in its last 3 digits.
Example: 0110100
The first four numbers has 4 spaces and 2 shiny coins therefore the number of combinations is 4 choose 2 = 6. The last 3 digits has 3 combinations for the same reason. So, probability for Case 1 to occur is:
Case 2: Using the fact that the combinations are uniquely determined by an order of 0s or 1s and you can just fill the rest, in you can ascertain:
So, P(Case 2)=
Case 3: Trivially, it is 1. P(Case 3)=
Adding all these probabilites together gives you the probability that the third shiny coin will not appear in your first 4 draws:
Since the fraction is irreducible:
,
The answer is E.
See also
1993 AHSME (Problems • Answer Key • Resources) | ||
Preceded by Problem 23 |
Followed by Problem 25 | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25 • 26 • 27 • 28 • 29 • 30 | ||
All AHSME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.