๐ Lemma 1 (Existence of Primitive Roots)
For every prime $p$ there exists an integer $g$ with the property that every integer not congruent to 0 modulo $p$ is congruent to a power of $g$ modulo $p$. Such an integer is called a primitive root modulo $p$.
Proof: Gauss published the first rigorous proof in Article 55 of the Disquisitiones Arithmeticae. The proof considers the polynomial $x^d - 1 \\pmod{p}$ for each divisor $d$ of $p - 1$. A counting argument shows that for each divisor $d$ there are exactly $\\varphi(d)$ elements of order $d$. In particul...
From: gal-edwards
Learn more:
Explore all courses: 

Magic Internet Math
Interactive courses covering the mathematics that powers modern technology, from foundational algebra to the cryptography securing the internet.

Magic Internet Math
Interactive courses covering the mathematics that powers modern technology, from foundational algebra to the cryptography securing the internet.