FermatsTheorem.md (400B)
1 # Fermat's (Little) Theorem 2 3 **Source:** Computer and Network Security 4 5 **Chapter:** 2.5 6 7 **Definition:** Fermat's theorem states if p is prime and a is a positive integer not divisible by p then $a^{p-1} \equiv 1 \text{(mod } p \text{)}$. 8 9 An alternative form of this is that $a^{p} \equiv a \text{(mod } p \text{)}$. With this statement there is no requirement that $a$ be relatively prime to $p$.