AoPSWiki
Visit the AoPS Book Store.
Personal tools

Euler's Totient Theorem

From AoPSWiki

Euler's Totient Theorem is a theorem closely related to his function of the same name.

Theorem

Let \phi(n) be Euler's totient function. If {a} is an integer and m is a positive integer relatively prime to a, then {a}^{\phi (m)}\equiv 1 \pmod {m}.

Credit

This theorem is credited to Leonhard Euler. It is a generalization of Fermat's Little Theorem, which specifies that {m} is prime. For this reason it is known as Euler's generalization and Fermat-Euler as well.

See also

Want to learn how to tackle those tough MATHCOUNTS and AMC counting and probability problems? Check out Art of Problem Solving's Introduction to Counting & Probability by David Patrick.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us