Euler's theorem
In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that if n and a are coprime positive integers, then a raised to the power of the totient of n is congruent to one, modulo n, or: The converse of Euler's theorem is also true: if the above congruence is true, then and must be coprime. The theorem is a generalization of Fermat's little theorem, and is further generalized by Carmichael's theorem. In general, when reducing a power of modulo (where and are coprime), one needs to work modulo in the exponent of : if , then .
Euler's TheoremEuler's Totient TheoremEuler's generalizationEuler's totient ruleEuler's totient theoremEuler-Fermat theoremEuler theoremEuler totient ruleEuler totient theoremEuler–Fermat theoremFermat-Euler theoremFermat-euler theoremFermat–Euler theoremProof of Euler-Fermat theorem using Lagrange's theorem
Wikipage redirect
Abstract algebraBlum Blum ShubCarmichael functionContributions of Leonhard Euler to mathematicsDaniel da Silva (mathematician)Dirichlet characterEuler's TheoremEuler's Totient TheoremEuler's generalizationEuler's totient ruleEuler's totient theoremEuler-Fermat theoremEuler theoremEuler totient ruleEuler totient theoremEuler–Fermat theoremFermat's little theoremFermat-Euler theoremFermat-euler theoremFermat–Euler theoremFizz buzzGaussian integerJulio Garavito ArmeroLagrange's theorem (group theory)Leonhard_EulerList of group theory topicsList of mathematical jargonList of mathematical proofsList of number theory topicsList of scientific laws named after peopleList of theoremsLudwig von TetmajerModular arithmeticModular multiplicative inverseP-adic numberPerfect digital invariantPierre de FermatPrimitive root modulo nProof of Euler-Fermat theorem using Lagrange's theoremProofs of Fermat's little theorem
Link from a Wikipage to another Wikipage
primaryTopic
Euler's theorem
In number theory, Euler's theorem (also known as the Fermat–Euler theorem or Euler's totient theorem) states that if n and a are coprime positive integers, then a raised to the power of the totient of n is congruent to one, modulo n, or: The converse of Euler's theorem is also true: if the above congruence is true, then and must be coprime. The theorem is a generalization of Fermat's little theorem, and is further generalized by Carmichael's theorem. In general, when reducing a power of modulo (where and are coprime), one needs to work modulo in the exponent of : if , then .
has abstract
Dalam teori bilangan, Teorema ...... at kesulitan untuk bilangan n.
@in
De stelling van Euler (ook wel ...... zelf gegeneraliseerd door de .
@nl
Der Satz von Euler, auch als S ...... ndigerweise prime) Moduli dar.
@de
Devido à numerosa produção teó ...... iferenciais Exatas, em Cálculo
@pt
En matemàtiques, i en particul ...... Per tant la xifra buscada és .
@ca
En mathématiques, le théorème ...... chiffre recherché est donc 9.
@fr
En teoría de números el teorem ...... φ(n) es la función φ de Euler.
@es
Eulerova věta (také známá jako ...... zobecňuje Carmichaelova věta.
@cs
Eulers sats inom talteorin säg ...... n är relativt prima så gäller:
@sv
In matematica, e in particolar ...... ato dal teorema di Carmichael.
@it
Link from a Wikipage to an external page
Wikipage page ID
page length (characters) of wiki page
Wikipage revision ID
1,014,607,829
Link from a Wikipage to another Wikipage
wikiPageUsesTemplate
comment
Dalam teori bilangan, Teorema ...... anjut dengan . . jika , maka .
@in
De stelling van Euler (ook wel ...... zelf gegeneraliseerd door de .
@nl
Der Satz von Euler, auch als S ...... ndigerweise prime) Moduli dar.
@de
Devido à numerosa produção teó ...... iferenciais Exatas, em Cálculo
@pt
En matemàtiques, i en particul ...... productes. aφ(n) ≡ 1 (mod n).
@ca
En mathématiques, le théorème ...... as où n est un nombre premier.
@fr
En teoría de números el teorem ...... φ(n) es la función φ de Euler.
@es
Eulerova věta (také známá jako ...... zobecňuje Carmichaelova věta.
@cs
Eulers sats inom talteorin säg ...... ika primtal och SGD(a,pq) = 1.
@sv
In matematica, e in particolar ...... ato dal teorema di Carmichael.
@it
label
Euler's theorem
@en
Eulerova věta (teorie čísel)
@cs
Eulers sats
@sv
Satz von Euler
@de
Stelling van Euler
@nl
Teorema Euler
@in
Teorema d'Euler
@ca
Teorema de Euler
@es
Teorema de Euler
@pt
Teorema di Eulero (aritmetica modulare)
@it