TOPICS
Search

Carmichael's Theorem

If a and n are relatively prime so that the greatest common divisor GCD(a,n)=1, then

a^(lambda(n))=1 (mod n),

where lambda is the Carmichael function.

Explore with Wolfram|Alpha

Cite this as:

Weisstein, Eric W. "Carmichael's Theorem." From MathWorld--A Wolfram Web Resource. https://mathworld.wolfram.com/CarmichaelsTheorem.html

Subject classifications