|
|
|
|
Gaussian integer
|
(Definition)
|
|
|
A complex number of the form , where
, is called a Gaussian integer.
It is easy to see that the set of all Gaussian integers is a subring of
; specifically, is the smallest subring containing , whence
.
is a Euclidean ring, hence a principal ring, hence a unique factorization domain.
There are four units (i.e. invertible elements) in the ring
, namely and . Up to multiplication by units, the primes in
are
Using the ring of Gaussian integers, it is not hard to show, for example, that the Diophantine equation has no solutions
except .
|
"Gaussian integer" is owned by Daume. [ full author list (2) | owner history (2) ]
|
|
(view preamble)
Cross-references: solutions, Diophantine equation, Thue's lemma, prime numbers, primes, multiplication, ring, invertible, units, unique factorization domain, principal ring, Euclidean ring, subring, easy to see, complex number
There are 7 references to this entry.
This is version 6 of Gaussian integer, born on 2001-10-15, modified 2003-10-08.
Object id is 207, canonical name is GaussianIntegers.
Accessed 6154 times total.
Classification:
| AMS MSC: | 11R04 (Number theory :: Algebraic number theory: global fields :: Algebraic numbers; rings of algebraic integers) |
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|