Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-cambridge/2012/ia/paper-4/1d/i/solution

Use the Euclidean algorithm: , , , and . Back-substitution gives the Bezout identity . Multiplying by gives one solution of the linear Diophantine equation, and shifting the coefficients by multiples of reduces it to
Indeed, . More generally all solutions are , , : subtracting this particular solution gives , and the coprime integers force .

New to topics? Read the docs here!