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

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

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

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