Existence of primitive roots modulo a prime
Builds on Primitive root modulo nPrime number
Statement
Let be a prime number. Then there is a primitive root modulo . That is, the multiplicative group is cyclic of order .
Remarks
A proof: a polynomial of degree has at most roots in the field . So for each , at most elements have order . The sum of the totient over the divisors then forces exactly elements of each order . In particular, there are exactly primitive roots modulo in . More generally, each finite subgroup of the multiplicative group of a field is cyclic.
Reading path
To understand this page from the ground up, read these 10 pages in order. The foundations come first.
Show the path as a graph
- no evidence level
- Divisibility definition
- Congruence modulo n definition
- Greatest common divisor definition
- Prime number definition
- Coprime integers definition
- Euler's totient function definition
- Euler's theorem statement
- Multiplicative order definition
- Primitive root modulo n definition
- Existence of primitive roots modulo a prime statement
Where this leads
1 page builds on this one.
Further reading
About this page
| Tag | 04XGKK8WQW |
|---|---|
| URI | m2://04XGKK8WQW |
| Kind | statement, theorem |
| Writing | W0 stub |
| MSC | 11A07 |
| Status | This copy of the site has no build data. Run m2 status 04XGKK8WQW. |
| Uses | Primitive root modulo n, Prime number |
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.