Difference between revisions of "2019 AIME I Problems/Problem 5"
m (→Solution) |
m (→Solution) |
||
Line 5: | Line 5: | ||
==Solution== | ==Solution== | ||
− | + | One could recursively compute the probabilities of reaching <math>(0,0)</math> as the first axes point from any point <math>(x,y)</math> as <cmath>P(x,y) = \frac{1}{3} P(x-1,y) + \frac{1}{3} P(x,y-1) + \frac{1}{3} P(x-1,y-1)</cmath> for <math>x,y \geq 1,</math> and the base cases are | |
<math>P(0,0) = 1, P(x,0) = P(y,0) = 0</math> for any <math>x,y</math> not equal to one. | <math>P(0,0) = 1, P(x,0) = P(y,0) = 0</math> for any <math>x,y</math> not equal to one. | ||
We then recursively find <math>P(4,4) = \frac{245}{2187}</math> so the answer is <math>245 + 7 = \boxed{252}</math>. | We then recursively find <math>P(4,4) = \frac{245}{2187}</math> so the answer is <math>245 + 7 = \boxed{252}</math>. |
Revision as of 22:54, 7 March 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. Find
.
jaskdfjskdjfksdfj
Solution
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 one.
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
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 |
These problems are copyrighted © by the Mathematical Association of America, as part of the American Mathematics Competitions.