info prev up next book cdrom email home

Carmichael's Theorem

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

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

where $\lambda$ is the Carmichael Function.




© 1996-9 Eric W. Weisstein
1999-05-26