1d. Apply the Euclidean Algorithm to 114 and 19.
114
=
In this case we cannot refer back to the last non-zero remainder. Since 19 is a factor of 114, gcd(114, 19) = 19.
Back to Section 3.8