1c. Apply the Euclidean Algorithm to 102 and 36.
102
=
36
The last non-zero remainder was 6, so gcd(102, 36) = 6.
Back to Section 3.8