<?xml version="1.0" encoding="UTF-8"?>

<record version="10" id="2955">
 <title>Euclidean domain</title>
 <name>EuclideanRing</name>
 <created>2002-05-27 22:59:18</created>
 <modified>2007-12-28 16:58:36</modified>
 <type>Definition</type>
 <creator id="2760" name="yark"/>
 <author id="2760" name="yark"/>
 <author id="3" name="drini"/>
 <classification>
	<category scheme="msc" code="13F07"/>
 </classification>
 <synonyms>
	<synonym concept="Euclidean domain" alias="Euclidean ring"/>
 </synonyms>
 <related>
	<object name="PID"/>
	<object name="UFD"/>
	<object name="EuclidsAlgorithm"/>
	<object name="Ring"/>
	<object name="IntegralDomain"/>
	<object name="EuclideanValuation"/>
	<object name="WhyEuclideanDomains"/>
 </related>
 <preamble>\usepackage{amssymb}

\newcommand{\Z}{\mathbb{Z}}
</preamble>
 <content>\PMlinkescapeword{even}

A \emph{Euclidean domain} is an integral domain
on which a Euclidean valuation can be defined.

Every Euclidean domain is a principal ideal domain,
and therefore also a unique factorization domain.

Any two elements of a Euclidean domain have a greatest common divisor,
which can be computed using the Euclidean algorithm.

An example of a Euclidean domain is the ring $\Z$.
Another example is the polynomial ring $F[x]$, where $F$ is any field.
Every field is also a Euclidean domain.</content>
</record>
