A frog located at , with both and integers, makes successive jumps of length and always lands on points with integer coordinates. Suppose that the frog starts at and ends at . What is the smallest possible number of jumps the frog makes?
This problem is copyrighted by the American Mathematics Competitions.
Instructions for entering answers:
For questions or comments, please email firstname.lastname@example.org.