Math 2.0

Number theory Definition

Primitive root of unity

Builds on Root of unity

Definition

Let nn be a positive integer. A complex number ζ\zeta is a primitive nnth root of unity when ζn=1\zeta^n = 1 and ζk≠1\zeta^k \neq 1 for each integer kk with 1≤k<n1 \le k < n.

Remarks

Equivalently, ζ\zeta has order exactly nn in the multiplicative group ℂ∖{0}\mathbb{C} \setminus \{0\}. If ζ\zeta is a primitive nnth root of unity, then 1,ζ,ζ2,…,ζn−11, \zeta, \zeta^2, \dots, \zeta^{n-1} are all the nnth roots of unity. The number e2πik/ne^{2 \pi i k / n} is primitive exactly when gcd⁡(k,n)=1\gcd(k, n) = 1. Thus there are φ(n)\varphi(n) primitive nnth roots of unity, where φ\varphi is Euler's totient function.

Reading path

To understand this page from the ground up, read these 3 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. Complex numbers object
  2. Root of unity definition
  3. Primitive root of unity definition

Where this leads

6 pages build on this one.

Further reading

  1. Web https://en.wikipedia.org/wiki/Root_of_unity, General definition
About this page
Tag0J817RTVG6
URIm2://0J817RTVG6
Kinddefinition
WritingW0 stub
MSC11R18
DefinesPrimitive root of unity
UsesRoot of unity

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

Used by