Fermat–Euler theorem, Euler's totient theoremif 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 differentEuler’s Equation Euler's Formula Euler Equation Euler’s Theorem Euler's theoremIn 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 ishttps://en.wikipedia.org/wiki/Euler's_theorem