Difference between revisions of "2019 AIME I Problems/Problem 5"
Icematrix2 (talk | contribs) |
|||
Line 23: | Line 23: | ||
==See Also== | ==See Also== | ||
{{AIME box|year=2019|n=I|num-b=4|num-a=6}} | {{AIME box|year=2019|n=I|num-b=4|num-a=6}} | ||
+ | |||
+ | [[Category:Intermediate Probability Problems]] | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 15:37, 16 October 2020
Problem 5
A moving particle starts at the point and moves until it hits one of the coordinate axes for the first time. When the particle is at the point
, it moves at random to one of the points
,
, or
, each with probability
, independently of its previous moves. The probability that it will hit the coordinate axes at
is
, where
and
are positive integers such that
is not divisible by
. Find
.
Solution 1
One could recursively compute the probabilities of reaching as the first axes point from any point
as
for
and the base cases are
for any
not equal to zero.
We then recursively find
so the answer is
.
If this algebra seems intimidating, you can watch a nice pictorial explanation of this by On The Spot Stem. https://www.youtube.com/watch?v=XBRuy3_TM9w
Solution 2
Obviously, the only way to reach (0,0) is to get to (1,1) and then have a chance to get to (0,0). Let x denote a move left 1 unit, y denote a move down 1 unit, and z denote a move left and down one unit each. The possible cases for these moves are
and
. This gives a probability of
to get to
. The probability of reaching
is
. This gives
.
Video Solution
Unique solution: https://youtu.be/I-8xZGhoDUY
~Shreyas S
See Also
2019 AIME I (Problems • Answer Key • Resources) | ||
Preceded by Problem 4 |
Followed by Problem 6 | |
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.