Euler-Fermat theoremEulerFermatTheorem2001-10-15 19:15:052007-08-23 21:29:40Theoremnumber theory\usepackage{amssymb}
\usepackage{amsmath}
\usepackage{amsfonts}
\usepackage{graphicx}
\usepackage{xypic}
If $a,n \in \mathbb{Z}$ such that $\gcd(a,n)=1$, then $a^{\varphi (n)} \equiv 1 \operatorname{mod} n$, where $\varphi$ is the Euler totient function.