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

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

Les procédés usuels de réduction, et en particulier l'algorithme LLL, deviennent plus performants lorsqu'on les adapte à ces structures, Numerous important lattices (𝔻₄, 𝔼₈, the Coxeter-Todd lattice ...