Difference between revisions of "2022 AMC 12B Problems/Problem 22"
Numerophile (talk | contribs) (→Solution 2 (Clever)) |
Mathfan2020 (talk | contribs) (Restored two solutions and three video solutions from AMC 10B problem 23 page) |
||
Line 5: | Line 5: | ||
==Solution 1== | ==Solution 1== | ||
+ | |||
+ | We use the following lemma to solve this problem. | ||
+ | |||
+ | --------------------------------------- | ||
+ | Let <math>y_1, y_2, \cdots, y_n</math> be independent random variables that are uniformly distributed on <math>(0,1)</math>. Then for <math>n = 2</math>, | ||
+ | <cmath> | ||
+ | \[ | ||
+ | \Bbb P \left( y_1 + y_2 \leq 1 \right) = \frac{1}{2} . | ||
+ | \] | ||
+ | </cmath> | ||
+ | |||
+ | For <math>n = 3</math>, | ||
+ | <cmath> | ||
+ | \[ | ||
+ | \Bbb P \left( y_1 + y_2 + y_3 \leq 1 \right) = \frac{1}{6} . | ||
+ | \] | ||
+ | </cmath> | ||
+ | --------------------------------------- | ||
+ | |||
+ | Now, we solve this problem. | ||
+ | |||
+ | We denote by <math>\tau</math> the last step Amelia moves. Thus, <math>\tau \in \left\{ 2, 3 \right\}</math>. | ||
+ | We have | ||
+ | |||
+ | <cmath> | ||
+ | \begin{align*} | ||
+ | P \left( \sum_{n=1}^\tau x_n > 1 \right) | ||
+ | & = P \left( x_1 + x_2 > 1 | t_1 + t_2 > 1 \right) | ||
+ | P \left( t_1 + t_2 > 1 \right) \\ | ||
+ | & \hspace{1cm} + P \left( x_1 + x_2 + x_3 > 1 | t_1 + t_2 \leq 1 \right) | ||
+ | P \left( t_1 + t_2 \leq 1 \right) \\ | ||
+ | & = P \left( x_1 + x_2 > 1 \right) | ||
+ | P \left( t_1 + t_2 > 1 \right) | ||
+ | + P \left( x_1 + x_2 + x_3 > 1 \right) | ||
+ | P \left( t_1 + t_2 \leq 1 \right) \\ | ||
+ | & = \left( 1 - \frac{1}{2} \right)\left( 1 - \frac{1}{2} \right) | ||
+ | + \left( 1 - \frac{1}{6} \right) \frac{1}{2} \\ | ||
+ | & = \boxed{\textbf{(C) } \frac{2}{3}} , | ||
+ | \end{align*} | ||
+ | </cmath> | ||
+ | |||
+ | where the second equation follows from the property that <math>\left\{ x_n \right\}</math> and <math>\left\{ t_n \right\}</math> are independent sequences, the third equality follows from the lemma above. | ||
+ | |||
+ | ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | ||
+ | |||
+ | ==Solution 2 (Elimination)== | ||
+ | There is a <math>0</math> probability that Amelia is past <math>1</math> after <math>1</math> turn, so Amelia can only pass <math>1</math> after <math>2</math> turns or <math>3</math> turns. The probability of finishing in <math>2</math> turns is <math>\frac{1}{2}</math> (due to the fact that the probability of getting <math>x</math> is the same as the probability of getting <math>2 - x</math>), and thus the probability of finishing in <math>3</math> turns is also <math>\frac{1}{2}</math>. | ||
+ | |||
+ | It is also clear that the probability of Amelia being past <math>1</math> in <math>2</math> turns is equal to <math>\frac{1}{2}</math>. | ||
+ | |||
+ | Therefore, if <math>x</math> is the probability that Amelia finishes if she takes three turns, our final probability is <math>\frac{1}{2} \cdot \frac{1}{2} + \frac{1}{2} \cdot x = \frac{1}{4} + \frac{1}{2} \cdot x</math>. | ||
+ | |||
+ | <math>x</math> must be a number between <math>0</math> and <math>1</math> (non-inclusive), and it is clearly greater than <math>\frac{1}{2}</math>, because the probability of getting more than <math>\frac{3}{2}</math> in <math>3</math> turns is <math>\frac{1}{2}</math>. Thus, the answer must be between <math>\frac{1}{2}</math> and <math>\frac{3}{4}</math>, non-inclusive, so the only answer that makes sense is <math>\fbox{C}</math>. | ||
+ | |||
+ | ~mathboy100 | ||
+ | |||
+ | |||
+ | ==Solution 3== | ||
Obviously the chance of Amelia stopping after only <math>1</math> step is <math>0</math>. | Obviously the chance of Amelia stopping after only <math>1</math> step is <math>0</math>. | ||
Line 13: | Line 71: | ||
Thus the answer is <math>\frac{1}{4}+\frac{5}{12}=\frac{2}{3}</math>. | Thus the answer is <math>\frac{1}{4}+\frac{5}{12}=\frac{2}{3}</math>. | ||
− | ==Solution | + | ==Solution 4 (Clever)== |
There are two cases: Amelia takes two steps or three steps. | There are two cases: Amelia takes two steps or three steps. | ||
Line 23: | Line 81: | ||
~mathboy100 | ~mathboy100 | ||
+ | |||
+ | == Video Solution by OmegaLearn Using Geometric Probability == | ||
+ | https://youtu.be/-AqhcVX8mTw | ||
+ | |||
+ | ~ pi_is_3.14 | ||
+ | ==Video Solution== | ||
+ | |||
+ | https://youtu.be/WsA94SmsF5o | ||
+ | |||
+ | ~ThePuzzlr | ||
+ | |||
+ | https://youtu.be/qOxnx_c9kVo | ||
+ | |||
+ | ~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com) | ||
==See Also== | ==See Also== |
Revision as of 22:39, 18 November 2022
Contents
Problem
Ant Amelia starts on the number line at and crawls in the following manner. For Amelia chooses a time duration and an increment independently and uniformly at random from the interval During the th step of the process, Amelia moves units in the positive direction, using up minutes. If the total elapsed time has exceeded minute during the th step, she stops at the end of that step; otherwise, she continues with the next step, taking at most steps in all. What is the probability that Amelia’s position when she stops will be greater than ?
Solution 1
We use the following lemma to solve this problem.
Let be independent random variables that are uniformly distributed on . Then for ,
For ,
Now, we solve this problem.
We denote by the last step Amelia moves. Thus, . We have
where the second equation follows from the property that and are independent sequences, the third equality follows from the lemma above.
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
Solution 2 (Elimination)
There is a probability that Amelia is past after turn, so Amelia can only pass after turns or turns. The probability of finishing in turns is (due to the fact that the probability of getting is the same as the probability of getting ), and thus the probability of finishing in turns is also .
It is also clear that the probability of Amelia being past in turns is equal to .
Therefore, if is the probability that Amelia finishes if she takes three turns, our final probability is .
must be a number between and (non-inclusive), and it is clearly greater than , because the probability of getting more than in turns is . Thus, the answer must be between and , non-inclusive, so the only answer that makes sense is .
~mathboy100
Solution 3
Obviously the chance of Amelia stopping after only step is .
When Amelia takes steps, then the sum of the time taken during the steps is greater than minute. Let the time taken be and respectively, then we need for , which has a chance of . Let the lengths of steps be and respectively, then we need for , which has a chance of . Thus the total chance for this case is .
When Amelia takes steps, then by complementary counting the chance of taking steps is . Let the lengths of steps be , and respectively, then we need for , which has a chance of . Thus the total chance for this case is .
Thus the answer is .
Solution 4 (Clever)
There are two cases: Amelia takes two steps or three steps.
The former case has a probability of , as stated above, and thus the latter also has a probability of .
The probability that Amelia passes after two steps is also , as it is symmetric to the probability above.
Thus, if the probability that Amelia passes after three steps is , our total probability is . We know that , and it is relatively obvious that (because the probability that is ). This means that our total probability is between and , non-inclusive, so the only answer choice that fits is
~mathboy100
Video Solution by OmegaLearn Using Geometric Probability
~ pi_is_3.14
Video Solution
~ThePuzzlr
~Steven Chen (Professor Chen Education Palace, www.professorchenedu.com)
See Also
2022 AMC 12B (Problems • Answer Key • Resources) | |
Preceded by Problem 21 |
Followed by Problem 23 |
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 12 Problems and Solutions |
2022 AMC 10B (Problems • Answer Key • Resources) | ||
Preceded by Problem 22 |
Followed by Problem 24 | |
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.