also referred to as Euler's totient function, the Euler totient, or Euler's totient. Jordan's totient is a generalization of Euler's. The cototient of n...

denotes Euler's totient function; that is a φ ( n ) ≡ 1 ( mod n ) . {\displaystyle a^{\varphi (n)}\equiv 1{\pmod {n}}.} In 1736, Leonhard Euler published...

totient function, and the least universal exponent function. The order of the multiplicative group of integers modulo n is φ(n), where φ is Euler's totient...

number theory, the totient summatory function Φ ( n ) {\displaystyle \Phi (n)} is a summatory function of Euler's totient function defined by: Φ ( n )...

been given simple yet ambiguous names such as Euler's function, Euler's equation, and Euler's formula. Euler's work touched upon so many fields that he is...

Jordan's totient function is a generalization of Euler's totient function, which is the same as J 1 ( n ) {\displaystyle J_{1}(n)} . The function is named...

then ap−1 ≡ 1 (mod p). Euler's theorem: If a and m are coprime, then aφ(m) ≡ 1 (mod m), where φ is Euler's totient function. A simple consequence of...

group (also called multiplicative group of integers modulo n) and Euler's totient function. The primitive residue class group of a modulus z is defined as...

where ϕ {\displaystyle \phi } is Euler's totient function, than any integer smaller than it. The first few highly totient numbers are 1, 2, 4, 8, 12, 24...

lists a few identities involving the divisor functions Euler's totient function, Euler's phi function Refactorable number Table of divisors Unitary divisor...