Euler's Totient Theorem: Difference between revisions

Revision as of 10:31, 18 June 2006

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

This theorem is credited to Leonhard Euler.

@@ Line 1: / Line 1: @@
 === Statement ===
-Let <math>\phi(n)</math> be [[Euler's totient function]]. If <math>{a}</math> is an integer and <math>n</math> is a positive integer, then <math>a^{\phi(m)}\equiv 1 \pmod {m}</math>.
+Let <math>\phi(n)</math> be [[Euler's totient function]]. If <math>{a}</math> is an integer and <math>n</math> is a positive integer, then <math>{a}^{\phi (m)}\equiv 1 \pmod {m}</math>.
 === Credit ===