Problem
2011 AMC 12B Problem 11
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
Full credit goes to MAA for authoring these problems. These problems were taken on the AOPS website.
Want to contribute problems and receive full credit? Click here to add your problem!
Please report any issues to us in our Discord server
Go to previous contest problem (SHIFT + Left Arrow) Go to next contest problem (SHIFT + Right Arrow)
Problem feedback
Difficulty
—