Theoremadvanced
Existence of primitive roots
Also called Gauss's theorem on primitive roots.
Primitive roots mod n exist exactly when n is 1, 2, 4, p^k, or 2p^k for odd prime p.
Primitive roots mod n exist exactly when n is 1, 2, 4, p^k, or 2p^k for odd prime p.
About this page
The build computes these levels from the evidence in the repository. Each row says what the next level needs. Read what the levels mean.
| Ladder | Level | What the next level needs |
|---|---|---|
| Human proof | H0 no proof |
|
| Lean | L0 no Lean part |
|
| Visual | V0 none |
|
| Writing | W0 stub |
|
Tag 31P105 Edit this page History Report an error