Difference between revisions of "2019 AMC 10B Problems/Problem 21"
(→Alternative finish) |
|||
(39 intermediate revisions by 25 users not shown) | |||
Line 1: | Line 1: | ||
− | We first want to find out | + | ==Problem== |
+ | |||
+ | Debra flips a fair coin repeatedly, keeping track of how many heads and how many tails she has seen in total, until she gets either two heads in a row or two tails in a row, at which point she stops flipping. What is the probability that she gets two heads in a row but she sees a second tail before she sees a second head? | ||
+ | |||
+ | <math>\textbf{(A) } \frac{1}{36} \qquad \textbf{(B) } \frac{1}{24} \qquad \textbf{(C) } \frac{1}{18} \qquad \textbf{(D) } \frac{1}{12} \qquad \textbf{(E) } \frac{1}{6}</math> | ||
+ | |||
+ | ==Solution 1== | ||
+ | |||
+ | We first want to find out which sequences of coin flips satisfy the given condition. For Debra to see the second tail before the second head, her first flip can't be heads, as that would mean she would either end with double tails before seeing the second head, or would see two heads before she sees two tails. Therefore, her first flip must be tails. The shortest sequence of flips by which she can get two heads in a row and see the second tail before she sees the second head is <math>THTHH</math>, which has a probability of <math>\frac{1}{2^5} = \frac{1}{32}</math>. Furthermore, she can prolong her coin flipping by adding an extra <math>TH</math>, which itself has a probability of <math>\frac{1}{2^2} = \frac{1}{4}</math>. Since she can do this indefinitely, this gives an infinite geometric series with a first term of <math>\frac{1}{32}</math> and a common ratio of <math>\frac{1}{4}</math>, which means the answer (by the infinite geometric series sum formula) is <math>\frac{\frac{1}{32}}{1-\frac{1}{4}} = \boxed{\textbf{(B) }\frac{1}{24}}</math>. | ||
+ | |||
+ | ===Alternative finish=== | ||
+ | You have <math>THT</math>...(insert any # of pairs of HT)...HH. You could have <math>0</math> pairs, <math>1</math> pair, <math>2</math> pairs, etc. of HT. Thus the probability is <math>(\frac{1}{2})^0+(\frac{1}{2})^2+(\frac{1}{2})^4+...=\frac{1}{(1-(\frac{1}{2})^2)}=4/3</math>. number of ways to get <math>THT...HH</math> in that order is <math>\frac{1}{8} * \frac{1}{4}</math>. Thus your probability is <math>\frac{1}{8} * \frac{4}{3} * \frac{1}{4} = \frac{1}{24}</math> as desired | ||
+ | |||
+ | ~mathboy282 | ||
+ | |||
+ | |||
+ | |||
+ | ~minor LaTeX edits by turttheturtlez | ||
+ | |||
+ | ==Solution 2 (Easier)== | ||
+ | Note that the sequence must start in <math>THT</math>, which happens with <math>\frac{1}{8}</math> probability. Now, let <math>P</math> be the probability that Debra will get two heads in a row after flipping <math>THT</math>. Either Debra flips two heads in a row immediately (probability <math>\frac{1}{4}</math>), or flips a head and then a tail and reverts back to the "original position" (probability <math>\frac{1}{4}P</math>). Therefore, <math>P=\frac{1}{4}+\frac{1}{4}P</math>, so <math>P=\frac{1}{3}</math>, so our final answer is <math>\frac{1}{8}\times\frac{1}{3}=\boxed{\textbf{(B) }\frac{1}{24}}</math>. | ||
+ | |||
+ | ~Stormersyle | ||
+ | |||
+ | ==Solution 3 (Even Easier)== | ||
+ | Since the sequence must start with <math>THT</math> and end with <math>HH</math> and only have <math>HT</math> in between, we use the infinite geometric series formula to get <math>\frac{1}{2^5}</math> which is the smallest option, <math>THTHH</math>,<math>+\frac{1}{2^7}</math>, the next best option, and so on and so forth until we have an infinite geometric series increasing at a rate of <math>X\frac{1}{2^2}</math> so it is equivalent to <math>\frac{\frac{1}{2^5}}{1-\frac{1}{2^2}}=\frac{1}{2^6}\cdot\frac{2^2}{3}=\frac{1}{3\cdot2^3}=\frac{1}{8\cdot3}=\boxed{\textbf{(B) }\frac{1}{24}}</math> | ||
+ | |||
+ | ~<B+ | ||
+ | |||
+ | ==Video Solution by OmegaLearn== | ||
+ | https://youtu.be/wopflrvUN2c?t=993 | ||
+ | |||
+ | ==Video Solution by OnTheSpotSTEM== | ||
+ | https://www.youtube.com/watch?v=2f1zEvfUe9o | ||
+ | |||
+ | ==See Also== | ||
+ | |||
+ | {{AMC10 box|year=2019|ab=B|num-b=20|num-a=22}} | ||
+ | {{MAA Notice}} |
Latest revision as of 15:27, 3 October 2024
Contents
Problem
Debra flips a fair coin repeatedly, keeping track of how many heads and how many tails she has seen in total, until she gets either two heads in a row or two tails in a row, at which point she stops flipping. What is the probability that she gets two heads in a row but she sees a second tail before she sees a second head?
Solution 1
We first want to find out which sequences of coin flips satisfy the given condition. For Debra to see the second tail before the second head, her first flip can't be heads, as that would mean she would either end with double tails before seeing the second head, or would see two heads before she sees two tails. Therefore, her first flip must be tails. The shortest sequence of flips by which she can get two heads in a row and see the second tail before she sees the second head is , which has a probability of . Furthermore, she can prolong her coin flipping by adding an extra , which itself has a probability of . Since she can do this indefinitely, this gives an infinite geometric series with a first term of and a common ratio of , which means the answer (by the infinite geometric series sum formula) is .
Alternative finish
You have ...(insert any # of pairs of HT)...HH. You could have pairs, pair, pairs, etc. of HT. Thus the probability is . number of ways to get in that order is . Thus your probability is as desired
~mathboy282
~minor LaTeX edits by turttheturtlez
Solution 2 (Easier)
Note that the sequence must start in , which happens with probability. Now, let be the probability that Debra will get two heads in a row after flipping . Either Debra flips two heads in a row immediately (probability ), or flips a head and then a tail and reverts back to the "original position" (probability ). Therefore, , so , so our final answer is .
~Stormersyle
Solution 3 (Even Easier)
Since the sequence must start with and end with and only have in between, we use the infinite geometric series formula to get which is the smallest option, ,, the next best option, and so on and so forth until we have an infinite geometric series increasing at a rate of so it is equivalent to
~<B+
Video Solution by OmegaLearn
https://youtu.be/wopflrvUN2c?t=993
Video Solution by OnTheSpotSTEM
https://www.youtube.com/watch?v=2f1zEvfUe9o
See Also
2019 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 20 |
Followed by Problem 22 | |
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 | ||
All AMC 10 Problems and Solutions |
The problems on this page are copyrighted by the Mathematical Association of America's American Mathematics Competitions.