+**Euler's Theorem** states that for any integer *a* coprime to *n*, *a* raised to the power of [Euler's Totient Function](/wiki/Euler's_Totient_Function) of *n* is congruent to 1 modulo *n*. This fundamental result in [Number Theory](/wiki/Number_Theory) generalizes Fermat's Little Theorem, forming a cornerstone for modern cryptography.
+## See also
+- [Fermat's Little Theorem](/wiki/Fermat's_Little_Theorem)
+- [Modular Arithmetic](/wiki/Modular_Arithmetic)
+- [Cryptography](/wiki/Cryptography)
... 1 more lines