Fermat's Little Theorem/Corollary 4

This article needs proofreading. Please check it for mathematical errors. If you believe there are none, please remove {{Proofread}} from the code. To discuss this page in more detail, feel free to use the talk page. When this work has been completed, you may remove this instance of {{Proofread}} from the code.

Corollary to Fermat's Little Theorem

Let $p^k$ be a prime power for some prime number $p$ and $k \in \Z_{\gt 0}$.

Let $n \in \Z_{\gt 0}$ with $p \nmid n$.

Then:

$n^{p^k - 1} \equiv 1 \pmod p$

Proof

From corollary 3 of Fermat's Little Theorem:

$n^{p^k} \equiv n \pmod p$

That is:

$p \divides \paren {n^{p^k} - n} = n \paren {n^{p^k - 1} - 1}$

Since $p \nmid n$, from Prime Divisor of Coprime Integers:

$p \divides \paren {n^{p^k - 1} - 1}$

That is:

$n^{p^k-1} \equiv 1 \pmod p$

$\blacksquare$