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

Determining the greatest common divisor is an example of finding an integer relation between two numbers. In 1977, mathematician Helaman Ferguson, then at Brigham Young University in Provo, Utah, and ...