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 )...

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...

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...

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...

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...

λ(n) is equal to the Euler totient function of n; for powers of 2 greater than 4 it is equal to one half of the Euler totient function of n: λ ( n ) = {...

Bessel functions. Asymptotic expansions of modified Struve functions. In relation to other special functions. An inequality for Euler's totient function. The...

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...

{\displaystyle n=pq} (with p ≠ q {\displaystyle p\neq q} ) the value of Euler's totient function φ ( n ) {\displaystyle \varphi (n)} (the number of positive integers...

the number 1: for instance, the formulas for Euler's totient function or for the sum of divisors function are different for prime numbers than they are...

following 899 and preceding 901. It is the square of 30 and the sum of Euler's totient function for the first 54 positive integers. In base 10, it is a Harshad...

mathematics In mathematics, Lehmer's totient problem asks whether there is any composite number n such that Euler's totient function φ(n) divides n − 1. This is...

In mathematics, Carmichael's totient function conjecture concerns the multiplicity of values of Euler's totient function φ(n), which counts the number...

ϕ ∗ 1 = Id {\displaystyle \phi *1={\text{Id}}} , proved under Euler's totient function. ϕ = Id ∗ μ {\displaystyle \phi ={\text{Id}}*\mu } , by Möbius...

{p^{\alpha }}},} where ϕ ( n ) {\displaystyle \phi (n)} is the Euler's totient function. The Euler numbers grow quite rapidly for large indices, as they have...

theory, a perfect totient number is an integer that is equal to the sum of its iterated totients. That is, one applies the totient function to a number n...

nontotient is a positive integer n which is not a totient number: it is not in the image of Euler's totient function φ, that is, the equation φ(x) = n has no solution...

equal to φ − 1.) Euler's totient function φ(n) in number theory; also called Euler's phi function. The cyclotomic polynomial functions Φn(x) of algebra...

The Riemann zeta function or Euler–Riemann zeta function, denoted by the Greek letter ζ (zeta), is a mathematical function of a complex variable defined...

discarded after d has been computed. In the original RSA paper, the Euler totient function φ(n) = (p − 1)(q − 1) is used instead of λ(n) for calculating the...

numbers. 266 is a nontotient number which is an even number not in Euler’s totient function. 266 is an inconsummate number. "Facts about the integer". Wolfram...

testing. It is an abelian, finite group whose order is given by Euler's totient function: | ( Z / n Z ) × | = φ ( n ) . {\displaystyle |(\mathbb {Z} /n\mathbb...

as a function of n {\displaystyle n} , where k {\displaystyle k} is a fixed integer φ ( n ) {\displaystyle \varphi (n)} : Euler's totient function, which...

of e {\displaystyle e} modulo ϕ ( n ) {\displaystyle \phi (n)} (Euler's totient function of n {\displaystyle n} ) is the trapdoor: f ( x ) = x e mod n ...

the origin (zero point) Sigma function: Sums of powers of divisors of a given natural number. Euler's totient function: Number of numbers coprime to (and...

omega functions Almost prime Semiprime Euler's totient function Highly cototient Highly totient Noncototient Nontotient Perfect totient Sparsely totient Aliquot...

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