Math 2.0

Number theory Definition

Gaussian prime

Builds on Gaussian integer

Definition

A Gaussian prime is a prime element of the ring ℤ[i]\mathbb{Z}[i] of Gaussian integers. That is, it is a nonzero Gaussian integer π\pi that is not a unit, with the following property. For all Gaussian integers α\alpha and β\beta, if π∣αβ\pi \mid \alpha \beta, then π∣α\pi \mid \alpha or π∣β\pi \mid \beta.

Remarks

Since ℤ[i]\mathbb{Z}[i] is a unique factorization domain, the Gaussian primes are also the irreducible elements: the non-units that are not a product of two non-units. A Gaussian integer α\alpha is a Gaussian prime if and only if one of two conditions holds. Either N(α)N(\alpha) is a prime number, or α\alpha is a unit times a prime p≡3(mod4)p \equiv 3 \pmod 4. For example, 1+i1 + i, 2+i2 + i and 33 are Gaussian primes. But 5=(2+i)(2−i)5 = (2 + i)(2 - i) is not.

Reading path

To understand this page from the ground up, read these 2 pages in order. The foundations come first.

Show the path as a graph
Each page uses the pages above it. The colour of the bar on a box shows how strong the evidence is, and the box also gives it as text. The list has the same pages.
  • no evidence level
  1. Gaussian integer definition
  2. Gaussian prime definition

Where this leads

1 page builds on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Gaussian_integer, Gaussian primes
About this page
Tag0GTEHJQRFK
URIm2://0GTEHJQRFK
Kinddefinition
WritingW1 stated
MSC11R11
DefinesGaussian prime
UsesGaussian integer

Markdown · JSON · Edit on GitHub

What this page needs for W2

  • edge instance_of in: one example (0 of 1)
  • edge not_instance_of in: one non-example that fails one clause (0 of 1)

The writing levels say how complete the text of a page is. They do not measure its truth.

What links here

Used by