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

SMU Office of Research & Tech Transfer - Have you ever followed a recipe to bake some bread? If you have, congratulations; you have executed an algorithm. The algorithms that follow us around the ...

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

Mathematics of Computation, Vol. 77, No. 261 (Jan., 2008), pp. 589-607 (19 pages) We describe a new subquadratic left-to-right GCD algorithm, inspired by Schönhage's algorithm for reduction of binary ...