Euler's Theorem
From ProofWiki
Contents |
Theorem
Let $a, m \in \Z: a \perp m$.
Let $\phi \left({m}\right)$ be the Euler Phi Function of $m$.
Then:
- $a^{\phi \left({m}\right)} \equiv 1 \pmod m$
Proof
Since $a \perp m$, the residue class modulo $m$ of $a$ belongs to the Multiplicative Group of Integers Modulo m $\left({\Z'_m, \times}\right)$.
Let $ k = \left|{\left[\!\left[{a}\right]\!\right]_m}\right|$ where $\left[\!\left[{a}\right]\!\right]_m \in \Z'_m$.
By Order of Element Divides Order of Finite Group, $k \backslash \left|{\Z'_m}\right|$.
Now $\left|{\Z'_m}\right| = \phi \left({m}\right)$, from the definition of the Euler Phi Function.
Thus:
| \(\displaystyle \) | \(\displaystyle \left[\!\left[{a}\right]\!\right]_m^k\) | \(=\) | \(\displaystyle \left[\!\left[{1}\right]\!\right]_m\) | \(\displaystyle \) | by definition of the order of a group element | ||
| \(\displaystyle \implies\) | \(\displaystyle \left[\!\left[{a}\right]\!\right]_m^{\phi \left({m}\right)}\) | \(=\) | \(\displaystyle \left[\!\left[{a^{\phi \left({m}\right)} }\right]\!\right]_m\) | \(\displaystyle \) | by Congruence of Powers | ||
| \(\displaystyle \) | \(\displaystyle \) | \(=\) | \(\displaystyle \left[\!\left[{1}\right]\!\right]_m\) | \(\displaystyle \) | |||
| \(\displaystyle \implies\) | \(\displaystyle a^{\phi \left({m}\right)}\) | \(\equiv\) | \(\displaystyle 1 \pmod m\) | \(\displaystyle \) | by definition of residue class |
$\blacksquare$
Source of Name
This entry was named for Leonhard Paul Euler.
Sources
- Donald E. Knuth: The Art of Computer Programming: Volume 1: Fundamental Algorithms (1968): $\S 1.2.4$: Exercise $28$
- Allan Clark: Elements of Abstract Algebra (1971)... (previous)... (next): $\S 42$