Difference between revisions of "2018 AIME I Problems/Problem 14"

(One page solution)
(Solution 2)
(13 intermediate revisions by 4 users not shown)
Line 42: Line 42:
 
(Solution by scrabbler94)
 
(Solution by scrabbler94)
  
==One page solution==
+
 
 +
== Solution 2 ==
 +
 
 +
Let <math>E_n</math> denotes the number of sequences with length <math>n</math> that ends at <math>E</math>. Define similarly for the other vertices. We seek for a recursive formula for <math>E_n</math>.
 +
<cmath>\begin{align*}
 +
E_n&=P_{3_{n-1}}+P_{4_{n-1}} \\
 +
&=P_{2_{n-2}}+P_{5_{n-2}} \\
 +
&=P_{1_{n-3}}+P_{3_{n-3}}+S_{n-3}+P_{5_{n-3}} \\
 +
&=(P_{3_{n-3}}+P_{5_{n-3}})+S_{n-3}+P_{1_{n-3}} \\
 +
&=E_{n-2}+S_{n-3}+P_{1_{n-3}} \\
 +
&=E_{n-2}+P_{1_{n-4}}+P_{4_{n-4}}+S_{n-4}+P_{2_{n-4}} \\
 +
&=E_{n-2}+(S_{n-4}+P_{1_{n-4}})+P_{4_{n-4}}+P_{2_{n-4}} \\
 +
&=E_{n-2}+(E_{n-1}-E_{n-3})+S_{n-5}+P_{5_{n-5}}+P_{1_{n-5}}+P_{3_{n-5}} \\
 +
&=E_{n-2}+(E_{n-1}-E_{n-3})+(S_{n-5}+P_{1_{n-5}})+(P_{5_{n-5}}+P_{3_{n-5}}) \\
 +
&=E_{n-2}+(E_{n-1}-E_{n-3})+(E_{n-2}-E_{n-4})+E_{n-4} \\
 +
&=E_{n-1}+2E_{n-2}-E_{n-3} \\
 +
\end{align*}</cmath>
 +
Computing a few terms we have <math>E_0=0</math>, <math>E_1=0</math>, <math>E_2=0</math>, <math>E_3=1</math>, and <math>E_4=1</math>.
 +
 
 +
Using the formula yields <math>E_5=3</math>, <math>E_6=4</math>, <math>E_7=9</math>, <math>E_8=14</math>, <math>E_9=28</math>, <math>E_{10}=47</math>, <math>E_{11}=89</math>, and <math>E_{12}=155</math>.
 +
 
 +
Finally adding yields <math>\sum_{k=0}^{12}E_k=\boxed{351}</math>.
 +
 
 +
~ Nafer
 +
 
 +
==Video Solution==
 +
https://www.youtube.com/watch?v=uWNExJc3hok
 +
 
 +
==Solution 3 (One page solution)==
  
 
[[Image:Aaaaaaaaaa.jpg|700px]]
 
[[Image:Aaaaaaaaaa.jpg|700px]]
Line 49: Line 77:
 
{{AIME box|year=2018|n=I|num-b=13|num-a=15}}
 
{{AIME box|year=2018|n=I|num-b=13|num-a=15}}
 
{{MAA Notice}}
 
{{MAA Notice}}
 +
 +
==Video Solution==
 +
To see a comprehensive video covering this, visit :
 +
https://www.youtube.com/watch?v=uWNExJc3hok

Revision as of 01:07, 18 November 2020

Problem

Let $SP_1P_2P_3EP_4P_5$ be a heptagon. A frog starts jumping at vertex $S$. From any vertex of the heptagon except $E$, the frog may jump to either of the two adjacent vertices. When it reaches vertex $E$, the frog stops and stays there. Find the number of distinct sequences of jumps of no more than $12$ jumps that end at $E$.

Solution

This is easily solved by recursion/dynamic programming. To simplify the problem somewhat, let us imagine the seven vertices on a line $E \leftrightarrow P_4 \leftrightarrow P_5 \leftrightarrow S \leftrightarrow P_1 \leftrightarrow P_2 \leftrightarrow P_3 \leftrightarrow E$. We can count the number of left/right (L/R) paths of length $\le 11$ that start at $S$ and end at either $P_4$ or $P_3$.

We can visualize the paths using the common grid counting method by starting at the origin $(0,0)$, so that a right (R) move corresponds to moving 1 in the positive $x$ direction, and a left (L) move corresponds to moving 1 in the positive $y$ direction. Because we don't want to move more than 2 units left or more than 3 units right, our path must not cross the lines $y = x+2$ or $y = x-3$. Letting $p(x,y)$ be the number of such paths from $(0,0)$ to $(x,y)$ under these constraints, we have the following base cases:

$p(x,0) = \begin{cases} 1 & x \le 3 \\ 0 & x > 3 \end{cases} \qquad p(0,y) = \begin{cases} 1 & y \le 2 \\ 0 & y > 2 \end{cases}$

and recursive step $p(x,y) = p(x-1,y) + p(x,y-1)$ for $x,y \ge 1$.

The filled in grid will look something like this, where the lower-left $1$ corresponds to the origin:

$\begin{tabular}{|c|c|c|c|c|c|c|c|} \hline 0 & 0 & 0 & 0 & \textbf{89} & & & \\ \hline 0 & 0 & 0 & \textbf{28} & 89 & & & \\ \hline 0 & 0 & \textbf{9} & 28 & 61 & 108 & 155 & \textbf{155} \\ \hline 0 & \textbf{3} & 9 & 19 & 33 & 47 & \textbf{47} & 0 \\ \hline \textbf{1} & 3 & 6 & 10 & 14 & \textbf{14} & 0 & 0 \\ \hline 1 & 2 & 3 & 4 & \textbf{4} & 0 & 0 & 0 \\ \hline 1 & 1 & 1 & \textbf{1} & 0 & 0 & 0 & 0 \\ \hline \end{tabular}$

The bolded numbers on the top diagonal represent the number of paths from $S$ to $P_4$ in 2, 4, 6, 8, 10 moves, and the numbers on the bottom diagonal represent the number of paths from $S$ to $P_3$ in 3, 5, 7, 9, 11 moves. We don't care about the blank entries or entries above the line $x+y = 11$. The total number of ways is $1+3+9+28+89+1+4+14+47+155 = \boxed{351}$.

(Solution by scrabbler94)


Solution 2

Let $E_n$ denotes the number of sequences with length $n$ that ends at $E$. Define similarly for the other vertices. We seek for a recursive formula for $E_n$. \begin{align*} E_n&=P_{3_{n-1}}+P_{4_{n-1}} \\ &=P_{2_{n-2}}+P_{5_{n-2}} \\ &=P_{1_{n-3}}+P_{3_{n-3}}+S_{n-3}+P_{5_{n-3}} \\ &=(P_{3_{n-3}}+P_{5_{n-3}})+S_{n-3}+P_{1_{n-3}} \\ &=E_{n-2}+S_{n-3}+P_{1_{n-3}} \\ &=E_{n-2}+P_{1_{n-4}}+P_{4_{n-4}}+S_{n-4}+P_{2_{n-4}} \\ &=E_{n-2}+(S_{n-4}+P_{1_{n-4}})+P_{4_{n-4}}+P_{2_{n-4}} \\ &=E_{n-2}+(E_{n-1}-E_{n-3})+S_{n-5}+P_{5_{n-5}}+P_{1_{n-5}}+P_{3_{n-5}} \\ &=E_{n-2}+(E_{n-1}-E_{n-3})+(S_{n-5}+P_{1_{n-5}})+(P_{5_{n-5}}+P_{3_{n-5}}) \\ &=E_{n-2}+(E_{n-1}-E_{n-3})+(E_{n-2}-E_{n-4})+E_{n-4} \\ &=E_{n-1}+2E_{n-2}-E_{n-3} \\ \end{align*} Computing a few terms we have $E_0=0$, $E_1=0$, $E_2=0$, $E_3=1$, and $E_4=1$.

Using the formula yields $E_5=3$, $E_6=4$, $E_7=9$, $E_8=14$, $E_9=28$, $E_{10}=47$, $E_{11}=89$, and $E_{12}=155$.

Finally adding yields $\sum_{k=0}^{12}E_k=\boxed{351}$.

~ Nafer

Video Solution

https://www.youtube.com/watch?v=uWNExJc3hok

Solution 3 (One page solution)

Aaaaaaaaaa.jpg (Solution by mathleticguyyy)

2018 AIME I (ProblemsAnswer KeyResources)
Preceded by
Problem 13
Followed by
Problem 15
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

Video Solution

To see a comprehensive video covering this, visit : https://www.youtube.com/watch?v=uWNExJc3hok