Problem-Solving Strategies · Superchallenge problem

Start from the pair $(1, 1)$. A move replaces $(a, b)$ by $(a + b, b)$ or by $(a, a + b)$. What is the fewest number of moves to reach $(100, 37)$?