 Solution

ID: past-exam-of-the-year-1-of-the-computer-science-course-of-the-university-of-oxford/2015/discrete-mathematics-continuous-mathematics-and-probability/3/c/i/solution

The greatest common divisor is the largest positive integer dividing both inputs:

g cd (a, b) = max {d \in N_{+} : d ∣ a and d ∣ b} .

This maximum exists because

1

belongs to the set and all its elements are at most

b

 New to topics? Read the docs here!