AoPSWiki
Trying to get to the USAMO in 2010? Our AIME Problem Series can help you get there! Click here to enroll today!

Euler's Totient Theorem

From AoPSWiki

Revision as of 23:31, 4 September 2008 by Temperal (Talk | contribs)
(diff) ← Older revision | Current revision (diff) | Newer revision → (diff)

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

Stay informed about new Art of Problem Solving developments.
Click here to join our mailing lists.
© Copyright 2008 AoPS Incorporated. All Rights Reserved. • FoundationPrivacyContact Us