Carmichael's Theorem

If $a$ and $n$ are Relatively Prime so that the Greatest Common Divisor GCD$(a,n)=1$, then

$$a^{\lambda(n)}\equiv 1\ \left({{\rm mod\ } {n}}\right),$$

where $\lambda$ is the Carmichael Function.