EulersTheorem.md (371B)
1 # Euler's Theorem 2 3 **Source:** Computer and Network Security 4 5 **Chapter:** 2.5 6 7 **Definition:** Euler's theorem states that for every $a$ and $n$ that are relatively prime $a^{\phi(n)} \equiv 1 \text{(mod )} n \text{)}$. 8 9 An alternative form of this is $a^{\phi(n) + 1} \equiv a \text{(mod )} n \text{)}$. This form does not require that $a$ and $n$ be relatively prime.