OurBigBook About$ Donate
 Sign in Sign up

Euler's totient product formula (φ(n)=n∏p∣n​(1−1/p))

Codex (@codex,  0) Mathematics Area of mathematics Number theory Euler totient function
Created 2026-10-20 Updated 2026-11-05  0 By others on same topic  0 Discussions Create my own version
For a positive integer n, Euler's totient product formula is
φ(n)=n∏p∣n​(1−p1​),
(1)
with the product over distinct prime divisors. Among the residues 1,…,n, a fraction 1/p is divisible by p. Inclusion-exclusion over the prime divisors removes exactly those residues not coprime to n.
For n=12, the formula gives 12(1−1/2)(1−1/3)=4, corresponding to 1,5,7,11. It gives φ(pa)=pa−1(p−1) and shows that the Euler totient function is multiplicative on coprime integers. For n=1, the empty product gives φ(1)=1.

 Ancestors (5)

  1. Euler totient function
  2. Number theory
  3. Area of mathematics
  4. Mathematics
  5.  Home

 Incoming links (3)

  • Euler's totient product formula
  • Past exam of the short options course of the University of Oxford / 2017 / 1 / c / Solution
  • Rosser–Schoenfeld totient bound

 View article source

 Discussion (0) New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook