Solution for Section 3.8 Question 1a

1a. Apply the Euclidean Algorithm to 403 and 31.

The last non-zero remainder was 31, so gcd(403, 186) = 31.

Back to Section 3.8