Page "Euclidean domain" Paragraph 0

In mathematics, more specifically in abstract algebra and ring theory, a Euclidean domain ( also called a Euclidean ring ) is a ring that can be endowed with a certain structure – namely a Euclidean function, to be described in detail below – which allows a suitable generalization of the Euclidean division of the integers.

This generalized Euclidean algorithm can be put to many of the same uses as Euclid's original algorithm in the ring of integers: in any Euclidean domain, one can apply the Euclidean algorithm to compute the greatest common divisor of any two elements.

In particular, the greatest common divisor of any two elements exists and can be written as a linear combination