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 "2011 AMC 12B Problems/Problem 11"

m (→‎Solution)
m
 
Line 5: Line 5:
  
 
== Solution ==
 
== Solution ==
−
Since the frog always jumps in length <math>5</math> and lands on a lattice point, the sum of its coordinates must change either by <math>5</math> (by jumping parallel to the x- or y-axis), or by <math>3</math> or <math>4</math> (based off the 3-4-5 right triangle).
+
Since the frog always jumps in length <math>5</math> and lands on a lattice point, the sum of its coordinates must change either by <math>5</math> (by jumping parallel to the x- or y-axis), or by <math>3</math> or <math>4</math> (3-4-5 right triangle).
  
−
Because either <math>1</math>, <math>5</math>, or <math>7</math> is always the change of the sum of the coordinates, the sum of the coordinates will always change from odd to even or vice versa. Thus, it is impossible for him to go from <math>(0,0)</math> to <math>(1,0)</math> in an even number of moves. Therefore, the frog cannot reach <math>(1,0)</math> in two moves.   
+
Because either <math>1</math>, <math>5</math>, or <math>7</math> is always the change of the sum of the coordinates, the sum of the coordinates will always change from odd to even or vice versa. Thus, it can't go from <math>(0,0)</math> to <math>(1,0)</math> in an even number of moves. Therefore, the frog cannot reach <math>(1,0)</math> in two moves.   
  
 
However, a path is possible in 3 moves:  from <math>(0,0)</math> to <math>(3,4)</math> to <math>(6,0)</math> to <math>(1,0)</math>.
 
However, a path is possible in 3 moves:  from <math>(0,0)</math> to <math>(3,4)</math> to <math>(6,0)</math> to <math>(1,0)</math>.

Latest revision as of 18:39, 7 August 2023

Problem

A frog located at $(x,y)$, with both $x$ and $y$ integers, makes successive jumps of length $5$ and always lands on points with integer coordinates. Suppose that the frog starts at $(0,0)$ and ends at $(1,0)$. What is the smallest possible number of jumps the frog makes?

$\textbf{(A)}\ 2 \qquad \textbf{(B)}\ 3 \qquad \textbf{(C)}\ 4 \qquad \textbf{(D)}\ 5 \qquad \textbf{(E)}\ 6$

Solution

Since the frog always jumps in length $5$ and lands on a lattice point, the sum of its coordinates must change either by $5$ (by jumping parallel to the x- or y-axis), or by $3$ or $4$ (3-4-5 right triangle).

Because either $1$, $5$, or $7$ is always the change of the sum of the coordinates, the sum of the coordinates will always change from odd to even or vice versa. Thus, it can't go from $(0,0)$ to $(1,0)$ in an even number of moves. Therefore, the frog cannot reach $(1,0)$ in two moves.

However, a path is possible in 3 moves: from $(0,0)$ to $(3,4)$ to $(6,0)$ to $(1,0)$.

Thus, the answer is $= \boxed{3 \textbf{}}$.

See also

2011 AMC 12B (Problems • Answer Key • Resources)
Preceded by
Problem 10 		Followed by
Problem 12
1 • 2 • 3 • 4 • 5 • 6 • 7 • 8 • 9 • 10 • 11 • 12 • 13 • 14 • 15 • 16 • 17 • 18 • 19 • 20 • 21 • 22 • 23 • 24 • 25
All AMC 12 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=2011_AMC_12B_Problems/Problem_11&oldid=196584"