Units and Prime Norm
Since is a Euclidean domain with norm , is a unit in iff . Therefore, the units in are .
If and is a prime, then is irreducible. Otherwise with non-unit elements , , it follows is a prime, which is impossible.
Irreducible Integers
If is a prime in and it is reducible in , then and so . It follows that as they are non-units. Therefore, is a sum of two squares of integers. Conversely, if , then and so is reducible.
Recall that when , can be written as and . Hence, and are reducible. On the other hand, if , then . Thus is irreducible.
Irreducible
Assume that irreducible has norm where are primes, then must divide one of because is irreducible and is prime. Hence and the factorization of is , that is, .
Up to associates, all the irreducible elements in are as follows:
- The element (of norm 2).
- The primes congruent to 3 modulo 4 (of norm ).
- The distinct irreducible factors and (each of norm p) of where is congruent to 1 modulo 4 .