The Gaussian integers form a Euclidean domain
Builds on Gaussian integerNorm of a Gaussian integerDivision algorithm
Statement
Let and be Gaussian integers with . Then there are Gaussian integers and with and , where is the norm. So , with the norm as Euclidean function, is a Euclidean domain.
Remarks
To find , round the real part and the imaginary part of the complex number to nearest integers. This gives even . As a consequence, is a principal ideal domain and a unique factorization domain. The quotient and the remainder are not always unique. This is the analogue of the division algorithm for integers.
History
Carl Friedrich Gauss introduced the Gaussian integers in 1832, in his second paper on biquadratic reciprocity. In it, he proved unique factorization.
Reading path
To understand this page from the ground up, read these 5 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Gaussian integer definition
- Division algorithm statement
- Norm of a Gaussian integer definition
- The Gaussian integers form a Euclidean domain statement
Further reading
- Web https://en.wikipedia.org/wiki/Gaussian_integer, Euclidean division
- Web https://en.wikipedia.org/wiki/Gaussian_integer, Historical background
About this page
| Tag | 0SPYEFH7H4 |
|---|---|
| URI | m2://0SPYEFH7H4 |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11R11 |
| Status | This copy of the site has no build data. Run m2 status 0SPYEFH7H4. |
| Uses | Gaussian integer, Norm of a Gaussian integer, Division algorithm |
Markdown · JSON · Edit on GitHub
What this page needs for W1
- an inventory row: the row of the inventory that the node accounts for (0 of 1)
The writing levels say how complete the text of a page is. They do not measure its truth.
What links here
No page links to this page yet.