Euler's totient φ(n)

Layer 0 — Mathematicsin the number-theory subtree

Number of integers in {1,…,n} coprime to n. Multiplicative, with φ(p) = p−1 for prime p. Generalises Fermat's little theorem.

Related concepts

Explore Euler's totient φ(n) on the interactive knowledge graph →