The Euclidean algorithm works with numbers of any size. To find the greatest common divisor of 77 and 187 using the Euclidean algorithm involves the process of long division, which you might have ...

M. R. MURTY, KATHLEEN L. PETERSEN, THE EUCLIDEAN ALGORITHM FOR NUMBER FIELDS AND PRIMITIVE ROOTS, Proceedings of the American Mathematical Society, Vol. 141, No. 1 (JANUARY 2013), pp. 181-190 ...

The oldest mathematics journal in the Western Hemisphere in continuous publication, the American Journal of Mathematics ranks as one of the most respected and celebrated journals in its field.