Hay I am going over some old exams and hit this:
(a) Use the Euclidean algorithm to show that $\gcd(60; 17) = 1$.
(b) Hence find integers $x, y$ satisfying $60x + 17y = 1$.
(c) Find another solution in integers to $60x + 17y = 1$ (distinct from your previous answer).
Finding the gcd is easy but i can seem to find any help on the rest. Can someone point me at something that might help?