Andere Kunden interessierten sich auch für
![A History of Non-Euclidean Geometry]( "A History of Non-Euclidean Geometry")
A History of Non-Euclidean Geometry133,99 €![Non-Euclidean geometry]( "Non-Euclidean geometry")
Non-Euclidean geometry22,99 €![Euclidean Algorithm]( "Euclidean Algorithm")
Euclidean Algorithm22,99 €![Euclidean Vector]( "Euclidean Vector")
Euclidean Vector22,99 €![Euclidean Geometry]( "Euclidean Geometry")
Euclidean Geometry32,99 €![Euclidean Group]( "Euclidean Group")
Euclidean Group22,99 €![Euclidean Distance]( "Euclidean Distance")
Euclidean Distance22,99 €
In mathematics, more specifically in abstract algebra and ring theory, a Euclidean domain 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 algorithm. 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 of them (Bézout identity). Also every ideal in a Euclidean domain is principal, which implies a suitable generalization of the Fundamental Theorem of Arithmetic: every Euclidean domain is a unique factorization domain. It is important to compare the class of Euclidean domains with the larger class of principal ideal domains (PIDs).