Difference between revisions of "2018 AIME II Problems/Problem 8"
(→Problem) |
(→Solution) |
||
Line 4: | Line 4: | ||
==Solution== | ==Solution== | ||
− | We solve this problem by working backwards. Notice, the only points the frog can be on to jump to <math>(4,4)</math> in one move are <math>(2,4),(3,4),(4,2),</math> and <math>(4,3)</math>. This applies to any other point, thus we can work our way from <math>(0,0)</math> to <math>(4,4)</math>, recording down the number of ways to get to each point. | + | We solve this problem by working backwards. Notice, the only points the frog can be on to jump to <math>(4,4)</math> in one move are <math>(2,4),(3,4),(4,2),</math> and <math>(4,3)</math>. This applies to any other point, thus we can work our way from <math>(0,0)</math> to <math>(4,4)</math>, recording down the number of ways to get to each point recursively. |
− | <math> | + | <math>(0,0): 1</math> |
− | + | <math>(1,0)=(0,1)=1</math> | |
− | \ | + | <math>(2,0)=(0, 2)=2</math> |
+ | <math>(3,0)=(0, 3)=3</math> | ||
+ | <math>(4,0)=(0, 4)=5</math> | ||
+ | <math>(1,1)=2</math>, <math>(1,2)=(2,1)=5</math>, <math>(1,3)=(3,1)=10</math>, <math>(1,4)=(4,1)= 20</math> | ||
+ | <math>(2,2)=14, (2,3)=(3,2)=32, (2,4)=(4,2)=71</math> | ||
+ | <math>(3,3)=84, (3,4)=(4,3)=207</math> | ||
+ | <math>(4,4)=2\cdot \left( (4,2)+(4,3)\right) = 2\cdot \left( 207+71\right)=2\cdot 278=\boxed{556}</math> | ||
+ | |||
+ | |||
{{AIME box|year=2018|n=II|num-b=7|num-a=9}} | {{AIME box|year=2018|n=II|num-b=7|num-a=9}} | ||
{{MAA Notice}} | {{MAA Notice}} |
Revision as of 11:22, 24 March 2018
Problem
A frog is positioned at the origin of the coordinate plane. From the point , the frog can jump to any of the points
,
,
, or
. Find the number of distinct sequences of jumps in which the frog begins at
and ends at
.
Solution
We solve this problem by working backwards. Notice, the only points the frog can be on to jump to in one move are
and
. This applies to any other point, thus we can work our way from
to
, recording down the number of ways to get to each point recursively.
,
,
,
2018 AIME II (Problems • Answer Key • Resources) | ||
Preceded by Problem 7 |
Followed by Problem 9 | |
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.