Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "2019 AIME I Problems/Problem 5"

(→‎Solution)
(→‎Solution)
Line 17: Line 17:
  
 
Solution by Zaxter22
 
Solution by Zaxter22
 +
 +
==Solution 2==
 +
Alternatively, 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 <math>P(x,y) = \frac{1}{3} P(x-1,y) + \frac{1}{3} P(x,y) + \frac{1}{3} P(x-1,y-1)</math> for <math>x,y \geq 1,</math> and the base cases are
 +
<math>P(0,0) = 1, P(x,0) = P(y,0)</math> for any <math>x,y.</math>
 +
We then recursively find <math>P(4,4) = \frac{245}{2187}</math> so the answer is <math>245 + 7 = \boxed{252}</math>.
  
 
==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}}
 
{{MAA Notice}}
 
{{MAA Notice}}

Revision as of 23:46, 15 March 2019

Problem 5

A moving particle starts at the point $(4,4)$ and moves until it hits one of the coordinate axes for the first time. When the particle is at the point $(a,b)$, it moves at random to one of the points $(a-1,b)$, $(a,b-1)$, or $(a-1,b-1)$, each with probability $\frac{1}{3}$, independently of its previous moves. The probability that it will hit the coordinate axes at $(0,0)$ is $\frac{m}{3^n}$, where $m$ and $n$ are positive integers. Find $m + n$.

Solution

A move from $(a,b)$ to $(a,b-1)$ is labeled as down ($D$), from $(a,b)$ to $(a-1,b)$ is labeled as left ($L$), and from $(a,b)$ to $(a-1,b-1)$ is labeled as slant ($S$). To arrive at $(0,0)$ without arriving at an axis first, the particle must first go to $(1,1)$ then do a slant move. The particle can arrive at $(1,1)$ through any permutation of the following 4 different cases: $SSS$, $SSDL$, $SDLDL$, and $DLDLDL$.

There is only $1$ permutation of $SSS$. Including the last move, there are $4$ possible moves, making the probability of this move $\frac{1}{3^4}$.

There are $\frac{4!}{2!} = 12$ permutations of $SSDL$, as the ordering of the two slants do not matter. There are $5$ possible moves, making the probability of this move $\frac{12}{3^5}$.

There are $\frac{5!}{2! \cdot 2!} = 30$ permutations of $SDLDL$, as the ordering of the two downs and two lefts do not matter. There are $6$ possible moves, making the probability of this move $\frac{30}{3^6}$.

There are $\frac{6!}{3! \cdot 3!} = 30$ permutations of $DLDLDL$, as the ordering of the three downs and three lefts do not matter. There are $7$ possible moves, making the probability of this move $\frac{20}{3^7}$.

Adding these, the total probability is $\frac{1}{3^4} + \frac{12}{3^5} + \frac{30}{3^6} + \frac{20}{3^7} = \frac{245}{3^7}$. Therefore, the answer is $245 + 7 = \boxed{252}$.

Solution by Zaxter22

Solution 2

Alternatively, one could recursively compute the probabilities of reaching $(0,0)$ as the first axes point from any point $(x,y)$ as $P(x,y) = \frac{1}{3} P(x-1,y) + \frac{1}{3} P(x,y) + \frac{1}{3} P(x-1,y-1)$ for $x,y \geq 1,$ and the base cases are $P(0,0) = 1, P(x,0) = P(y,0)$ for any $x,y.$ We then recursively find $P(4,4) = \frac{245}{2187}$ so the answer is $245 + 7 = \boxed{252}$.

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. AMC logo.png

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=2019_AIME_I_Problems/Problem_5&oldid=104568"