The Euclidean algorithm offers a recipe for finding the greatest common divisor of two whole numbers. Suppose the given numbers are 12 and 18.

Using this result, we show that the Padé approximants to a given power series can also be obtained from Euclid's algorithm. SIAM Journal on Applied Mathematics contains research articles on ...

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