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 ...

I'm looking for what the title says. Euclidean algorithm works and is fast for just a pair of numbers, but I don't see any obvious generalizations. A quick googling didn't turn up anything too ...