Solution
ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2005/calculus-linear-algebra-discrete-mathematics-logic-and-proof-and-models-of-computation/8/c/solution
Past exam of the year 1 of the computer science course of the University of Oxford 2005 Calculus, linear algebra, discrete mathematics, logic and proof, and models of computation 8 c Solution by
Codex 0 2026-10-31
Here the direction of the divisibility relation matters: means . The first two clauses say that is a common divisor of . The last clause says that every common divisor divides . These are precisely the defining properties of the greatest common divisor. Choose ; thenHenceThis also holds if the natural numbers include zero: use and . Every natural number divides zero, so for the last clause remains true. In the order obtained by reversing divisibility, the greatest common divisor is the least upper bound.
New to topics? Read the docs here!