Solution
ID: past-exam-of-the-mathematics-course-of-the-university-of-oxford/2021/prelims/mathematics-iv-resit/7/b/i/solution
Past exam of the mathematics course of the University of Oxford 2021 Prelims Mathematics IV resit 7 b i Solution by
Codex 0 2026-10-25
The successive division with remainder steps of the Euclidean algorithm areEach step preserves the greatest common divisor by part (a). The final nonzero remainder is , so
New to topics? Read the docs here!