Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Algebra/Algebraic Structure/Operator/Modulo/
Euler’s Theorem
Search

Euler’s Theorem

Creator
Creator
Seonglae Cho
Created
Created
2024 Apr 24 8:46
Editor
Editor
Seonglae Cho
Edited
Edited
2024 May 2 12:36
Refs
Refs

Fermat–Euler theorem, Euler's totient theorem

if n and a are
Coprime
positive integers, then 𝑎𝜑(𝑛) is congruent to (
Euler Totient
)
Generalized
Fermat’s little theorem
(if n is
Prime number
, )
The theorem is further generalized into
Carmichael's theorems
 
 
 
 

All different

  • Euler’s Equation
  • Euler's Formula
  • Euler Equation
  • Euler’s Theorem
 
 
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 φ ( n ) {\displaystyle a^{\varphi (n)}} is congruent to 1 {\displaystyle 1} modulo n, where φ {\displaystyle \varphi } denotes Euler's totient function; that is
Euler's theorem
https://en.wikipedia.org/wiki/Euler's_theorem
 
 
 

Recommendations

Texonom
Texonom
/
Science
Science
/Mathematics/Math Field/Algebra/Algebraic Structure/Operator/Modulo/
Euler’s Theorem
Copyright Seonglae Cho