Euler's theorem
Template:Short description Template:About In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that, if Template:Math and Template:Math are coprime positive integers, then <math>a^{\varphi(n)}</math> is congruent to <math>1</math> modulo Template:Math, where <math>\varphi</math> denotes Euler's totient function; that is
- <math>a^{\varphi (n)} \equiv 1 \pmod{n}.</math>
In 1736, Leonhard Euler published a proof of Fermat's little theorem<ref>See:
- Leonhard Euler (presented: August 2, 1736; published: 1741) "Theorematum quorundam ad numeros primos spectantium demonstratio" (A proof of certain theorems regarding prime numbers), Commentarii academiae scientiarum Petropolitanae, 8 : 141–146.
- For further details on this paper, including an English translation, see: The Euler Archive.</ref> (stated by Fermat without proof), which is the restriction of Euler's theorem to the case where Template:Mvar is a prime number. Subsequently, Euler presented other proofs of the theorem, culminating with his paper of 1763, in which he proved a generalization to the case where Template:Mvar is not prime.<ref>See:
- L. Euler (published: 1763) "Theoremata arithmetica nova methodo demonstrata" (Proof of a new method in the theory of arithmetic), Novi Commentarii academiae scientiarum Petropolitanae, 8 : 74–104. Euler's theorem appears as "Theorema 11" on page 102. This paper was first presented to the Berlin Academy on June 8, 1758 and to the St. Petersburg Academy on October 15, 1759. In this paper, Euler's totient function, <math>\varphi(n)</math>, is not named but referred to as "numerus partium ad N primarum" (the number of parts prime to N; that is, the number of natural numbers that are smaller than N and relatively prime to N).
- For further details on this paper, see: The Euler Archive.
- For a review of Euler's work over the years leading to Euler's theorem, see: Ed Sandifer (2005) "Euler's proof of Fermat's little theorem" Template:Webarchive</ref>
The converse of Euler's theorem is also true: if the above congruence is true, then <math>a</math> and <math>n</math> must be coprime.
The theorem is further generalized by some of Carmichael's theorems.
The theorem may be used to easily reduce large powers modulo <math>n</math>. For example, consider finding the ones place decimal digit of <math>7^{222}</math>, i.e. <math>7^{222} \pmod{10}</math>. The integers 7 and 10 are coprime, and <math>\varphi(10) = 4</math>. So Euler's theorem yields <math>7^4 \equiv 1 \pmod{10}</math>, and we get <math>7^{222} \equiv 7^{4 \times 55 + 2} \equiv (7^4)^{55} \times 7^2 \equiv 1^{55} \times 7^2 \equiv 49 \equiv 9 \pmod{10}</math>.
In general, when reducing a power of <math>a</math> modulo <math>n</math> (where <math>a</math> and <math>n</math> are coprime), one needs to work modulo <math>\varphi(n)</math> in the exponent of <math>a</math>:
- if <math>x \equiv y \pmod{\varphi(n)}</math>, then <math>a^x \equiv a^y \pmod{n}</math>.
Euler's theorem underlies the RSA cryptosystem, which is widely used in Internet communications. In this cryptosystem, Euler's theorem is used with Template:Mvar being a product of two large prime numbers, and the security of the system is based on the difficulty of factoring such an integer.
ProofsEdit
1. Euler's theorem can be proven using concepts from the theory of groups:<ref>Ireland & Rosen, corr. 1 to prop 3.3.2</ref> The residue classes modulo Template:Mvar that are coprime to Template:Mvar form a group under multiplication (see the article Multiplicative group of integers modulo n for details). The order of that group is Template:Math. Lagrange's theorem states that the order of any subgroup of a finite group divides the order of the entire group, in this case Template:Math. If Template:Mvar is any number coprime to Template:Mvar then Template:Mvar is in one of these residue classes, and its powers Template:Math modulo Template:Mvar form a subgroup of the group of residue classes, with Template:Math. Lagrange's theorem says Template:Mvar must divide Template:Math, i.e. there is an integer Template:Mvar such that Template:Math. This then implies,
- <math>a^{\varphi(n)} = a^{kM} = (a^{k})^M \equiv 1^M =1 \pmod{n}.</math>
2. There is also a direct proof:<ref>Hardy & Wright, thm. 72</ref><ref>Landau, thm. 75</ref> Let Template:Math be a reduced residue system (Template:Math) and let Template:Mvar be any integer coprime to Template:Mvar. The proof hinges on the fundamental fact that multiplication by Template:Mvar permutes the Template:Mvar: in other words if Template:Math then Template:Math. (This law of cancellation is proved in the article Multiplicative group of integers modulo n.<ref>See Bézout's lemma</ref>) That is, the sets Template:Mvar and Template:Math, considered as sets of congruence classes (Template:Math), are identical (as sets—they may be listed in different orders), so the product of all the numbers in Template:Mvar is congruent (Template:Math) to the product of all the numbers in Template:Mvar:
- <math>
\prod_{i=1}^{\varphi(n)} x_i \equiv \prod_{i=1}^{\varphi(n)} ax_i = a^{\varphi(n)}\prod_{i=1}^{\varphi(n)} x_i \pmod{n}, </math> and using the cancellation law to cancel each Template:Mvar gives Euler's theorem:
- <math>
a^{\varphi(n)}\equiv 1 \pmod{n}. </math>
See alsoEdit
NotesEdit
ReferencesEdit
The Disquisitiones Arithmeticae has been translated from Gauss's Ciceronian Latin into English and German. The German edition includes all of his papers on number theory: all the proofs of quadratic reciprocity, the determination of the sign of the Gauss sum, the investigations into biquadratic reciprocity, and unpublished notes.