SG
← Back

Euler Totient Function

φ(n) counts integers ≤ n coprime to n.

mathnumber-theorytotientUpdated 2025-09-01

Formula

  • φ(n)=n Π (1-1/p) over distinct primes p

Use

  • Euler's theorem