# Difference between revisions of "Euler's Totient Theorem"

m (fixed LaTeX) |
|||

Line 1: | Line 1: | ||

=== Statement === | === 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 === | === Credit === |

## Revision as of 11:31, 18 June 2006

### Statement

Let be Euler's totient function. If is an integer and is a positive integer, then .

### Credit

This theorem is credited to Leonhard Euler.