To find the greatest common divisor of 77 and 187 using the Euclidean algorithm involves the process of long division, which you might have first encountered in elementary school. Divide 77 into 187.

Using Euclid's algorithm as an example, Dr. Lamport walked the audience through how an algorithm can be expressed precisely yet simply with mathematics. Described by ancient Greek mathematician Euclid ...

Described by ancient Greek mathematician Euclid in 300 BC, Euclid's algorithm is a method for identifying the greatest common divisor (GCD) of two numbers, that is, the largest number that can divide ...

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

Let K be a number field with unit rank at least four, containing a subfield M such that K/M is Galois of degree at least four. We show that the ring of integers of K is a Euclidean domain if and only ...

Niels Möller, On Schönhage's Algorithm and Subquadratic Integer GCD Computation, Mathematics of Computation, Vol. 77, No. 261 (Jan., 2008), pp. 589-607 ...