Solution

ID: past-exam-of-the-mathematics-course-of-the-university-of-oxford/2021/prelims/mathematics-iv-resit/7/b/i/solution

The successive division with remainder steps of the Euclidean algorithm are
Each step preserves the greatest common divisor by part (a). The final nonzero remainder is , so

New to topics? Read the docs here!