Difference between revisions of "2019 AMC 12A Problems/Problem 20"

(Removed redirect to 2019 AMC 10A Problems/Problem 22)
(Tag: Removed redirect)
(Tag: Redirect target changed)
 
(3 intermediate revisions by 2 users not shown)
Line 1: Line 1:
 
+
#REDIRECT[[2019_AMC_10A_Problems/Problem_22]]
==Problem==
 
 
 
Real numbers between 0 and 1, inclusive, are chosen in the following manner. A fair coin is flipped. If it lands heads, then it is flipped again and the chosen number is 0 if the second flip is heads, and 1 if the second flip is tails. On the other hand, if the first coin flip is tails, then the number is chosen uniformly at random from the closed interval <math>[0,1]</math>. Two random numbers <math>x</math> and <math>y</math> are chosen independently in this manner. What is the probability that <math>|x-y| > \tfrac{1}{2}</math>?
 
 
 
<math>\textbf{(A) } \frac{1}{3} \qquad \textbf{(B) } \frac{7}{16} \qquad \textbf{(C) } \frac{1}{2} \qquad \textbf{(D) } \frac{9}{16} \qquad \textbf{(E) } \frac{2}{3}</math>
 
 
 
==Solution 1==
 
 
 
There are several cases depending on what the first coin flip is when determining <math>x</math> and what the first coin flip is when determining <math>y</math>.
 
 
 
The four cases are:
 
 
 
'''Case 1''': <math>x</math> is either <math>0</math> or <math>1</math>, and <math>y</math> is either <math>0</math> or <math>1</math>.
 
 
 
'''Case 2''': <math>x</math> is either <math>0</math> or <math>1</math>, and <math>y</math> is chosen from the interval <math>[0,1]</math>.
 
 
 
'''Case 3''': <math>x</math> is is chosen from the interval <math>[0,1]</math>, and <math>y</math> is either <math>0</math> or <math>1</math>.
 
 
 
'''Case 4''': <math>x</math> is is chosen from the interval <math>[0,1]</math>, and <math>y</math> is also chosen from the interval <math>[0,1]</math>.
 
 
 
Each case has a <math>\frac{1}{4}</math> chance of occurring (as it requires two coin flips).
 
 
 
For Case 1, we need <math>x</math> and <math>y</math> to be different. Therefore, the probability for success in Case 1 is <math>\frac{1}{2}</math>.
 
 
 
For Case 2, if <math>x</math> is 0, we need <math>y</math> to be in the interval <math>\left(\frac{1}{2}, 1\right]</math>. If <math>x</math> is 1, we need <math>y</math> to be in the interval <math>\left[0, \frac{1}{2}\right)</math>. Regardless of what <math>x</math> is, the probability for success for Case 2 is <math>\frac{1}{2}</math>.
 
 
 
By symmetry, Case 3 has the same success rate as Case 2.
 
 
 
For Case 4, we must use geometric probability because there are an infinite number of pairs <math>(x, y)</math> that can be selected, whether they satisfy the inequality or not. Graphing <math>|x-y| > \tfrac{1}{2}</math> gives us the following picture where the shaded area is the set of all the points that fulfill the inequality:
 
 
 
<asy>
 
filldraw((0,0)--(0,1)--(1/2,1)--(0,1/2)--cycle,black+linewidth(1));
 
filldraw((0,0)--(1,0)--(1,1/2)--(1/2,0)--cycle,black+linewidth(1));
 
draw((0,0)--(0,1)--(1,1)--(1,0)--cycle);
 
</asy>
 
 
 
The shaded area is <math>\frac{1}{4}</math>, which means the probability for success for case 4 is <math>\frac{1}{4}</math> (since the total area of the bounding square, containing all possible pairs, is <math>1</math>).
 
 
 
Adding up the success rates from each case, we get:
 
 
 
<math>\left(\frac{1}{4}\right) \cdot \left(\frac{1}{2} + \frac{1}{2} + \frac{1}{2} + \frac{1}{4}\right) = \boxed{\textbf{(B) }\frac{7}{16}}</math>.
 
 
 
 
 
==Solution 2==
 
Taking into account that there are two options for the result of the first coin flip, there are four possible combinations with equal possibility of initial coins flips.
 
 
 
(1) x: heads, y: heads
 
 
 
(2) x: heads, y: tails
 
 
 
(3) x: tails, y: heads
 
 
 
(4) x: tails, y: tails
 
 
 
(1) Because x and y both must be integers, so it's simple to see that the probability that <math>|x-y| > \tfrac{1}{2}</math> is <math>\frac{1}{2}</math>.
 
 
 
(2) Since x has to be an integer it is also easy to see that the probability is again <math>\frac{1}{2}</math>.
 
 
 
(3) This is the same as case 2 so the probability is <math>\frac{1}{2}</math>.
 
 
 
(4) This one is a little bit tricky. You could use geometric probability shown above, but if you don't understand it or happened to not think of it, there is another solution that involves using the multiple choice answers.
 
 
 
First, the probability we have so far is <math>\frac{3}{8}</math>.This is greater than <math>\frac{1}{3}</math> so <math>A</math> is the not the answer. It is either <math>B, C, D,</math> or <math>E</math>. Let's draw out the probability with two parallel lines on a paper with represent a number line from <math>0-1</math>. The concept is to compare one point and find the fraction of the other line that contains points that are at least <math>\frac{1}{2}</math> away from it. If the point we choose is on the endpoints, then the fraction of the other line that works is exactly <math>\frac{1}{2}</math>. But as we move this point closer to the middle, the deadzone (area where the other point cannot be) grows, diminishing the probability. Finally, when it is directly in the middle, there are no points that pass the requirements except at <math>1</math> and <math>0</math>.
 
 
 
So, looking at the choices again, we have <math>\frac{7}{16}</math>, <math>\frac{1}{2}</math>, <math>\frac{9}{16}</math>, and <math>\frac{2}{3}</math>.
 
 
 
<math>\frac{1}{2}</math> is exactly <math>\frac{1}{8}</math> more than the probability we had before. Notice that this is impossible because we proved that the average probability of the fourth case is lower than <math>\frac{1}{2}</math>, so the answer is <math>\boxed{B}</math>.
 
 
 
-jackshi2006
 
 
 
==Video Solution 1==
 
https://youtu.be/wimynTAVIx8
 
 
 
Education, the Study of Everything
 
 
 
== Video Solution 3 ==
 
https://youtu.be/ZhAZ1oPe5Ds?t=263
 
 
 
~ pi_is_3.14
 
 
 
== Video Solution by Richard Rusczyk  ==
 
https://www.youtube.com/watch?v=Fe5bDwSzsOs
 
 
 
==See Also==
 
 
 
{{AMC10 box|year=2019|ab=A|num-b=21|num-a=23}}
 
{{AMC12 box|year=2019|ab=A|num-b=19|num-a=21}}
 
{{MAA Notice}}
 

Latest revision as of 10:23, 8 October 2023