Difference between revisions of "1995 AIME Problems/Problem 15"
m |
|||
Line 48: | Line 48: | ||
==Solution 4(fast)== | ==Solution 4(fast)== | ||
− | Consider what happens in the "endgame" or what leads to the end. Let A denote that a head has been flipped, and let B denote that a tail has been flipped. The endgame outcomes are AAAAA, BAAAAA, BB, ABB, AABB, AAABB, AAAABB. The probabilities of each of these are <math>\frac{1}{32},\frac{1}{64},\frac{1}{4},\frac{1}{8},\frac{1}{16},\frac{1}{32},\frac{1}{64}\) respectively. The ones where there is five heads are AAAAA and BAAAAA. The sum of these probabilities are \( \frac{3}{64}</math>. The sum of all these endgame outcomes are <math>\frac{34}{64}</math>, hence the desired probability is <math>\frac{3}{34}</math>, and in this case <math>m=3,n=34</math> so we have <math>m+n=\boxed{037}</math> | + | Consider what happens in the "endgame" or what ultimately leads to the end. Let A denote that a head has been flipped, and let B denote that a tail has been flipped. The endgame outcomes are AAAAA, BAAAAA, BB, ABB, AABB, AAABB, AAAABB. The probabilities of each of these are <math>\frac{1}{32},\frac{1}{64},\frac{1}{4},\frac{1}{8},\frac{1}{16},\frac{1}{32},\frac{1}{64}\) respectively. The ones where there is five heads are AAAAA and BAAAAA. The sum of these probabilities are \( \frac{3}{64}</math>. The sum of all these endgame outcomes are <math>\frac{34}{64}</math>, hence the desired probability is <math>\frac{3}{34}</math>, and in this case <math>m=3,n=34</math> so we have <math>m+n=\boxed{037}</math> |
-vsamc | -vsamc | ||
Revision as of 10:57, 4 January 2020
Problem
Let be the probability that, in the process of repeatedly flipping a fair coin, one will encounter a run of heads before one encounters a run of tails. Given that can be written in the form where and are relatively prime positive integers, find .
Contents
Solution
Solution 1
Think of the problem as a sequence of H's and T's. No two T's can occur in a row, so the sequence is blocks of to H's separated by T's and ending in H's. Since the first letter could be T or the sequence could start with a block of H's, the total probability is that of it has to start with an H.
The answer to the problem is then the sum of all numbers of the form , where are all numbers , since the blocks of H's can range from in length. The sum of all numbers of the form is , so if there are n blocks of H's before the final five H's, the answer can be rewritten as the sum of all numbers of the form , where ranges from to , since that's how many blocks of H's there can be before the final five. This is an infinite geometric series whose sum is , so the answer is .
Solution 2
Let respectively denote the probabilities that a string beginning with H's and T's are successful. Thus,
A successful string can either start with 1 to 4 H's, start with a T and then continue with a string starting with H (as there cannot be T's in a row, or be the string HHHHH.
There is a probability we roll consecutive H's, and there is a probability we roll a T. Thus,
The answer is , and .
Solution 3
For simplicity, let's compute the complement, namely the probability of getting to tails before heads.
Let denote the probability that we get tails before heads, given that we have consecutive heads. Similarly, let denote the probability that we get tails before heads, given that we have consecutive tails. Specifically, and . If we can solve for and , we are done; the answer is simply , since on our first roll, we have equal chances of getting a string with "1 consecutive head" or "1 consecutive tail."
Consider solving for . If we have 1 consecutive tail, then (a) rolling a head gets us to 1 consecutive head and (b) rolling a tail gets us to 2 consecutive tails. So, we must have:
Applying similar logic, we get the equations:
Since , we get .
So, the probability of reaching tails before heads is ; we want the complement, , yielding an answer of .
Note: The same approach still works if we tried solving the original problem rather than the complement; we would have simply used and instead. The repeated back-substitution is cleaner because we used the complement.
Solution 4(fast)
Consider what happens in the "endgame" or what ultimately leads to the end. Let A denote that a head has been flipped, and let B denote that a tail has been flipped. The endgame outcomes are AAAAA, BAAAAA, BB, ABB, AABB, AAABB, AAAABB. The probabilities of each of these are . The sum of all these endgame outcomes are , hence the desired probability is , and in this case so we have -vsamc
See also
1995 AIME (Problems • Answer Key • Resources) | ||
Preceded by Problem 14 |
Followed by Last question | |
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 | ||
All AIME Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.