Euler's totient product formula
ID: euler-s-totient-product-formula
For a positive integer , Euler's totient product formula iswith the product over distinct prime divisors. Among the residues , a fraction is divisible by . Inclusion-exclusion over the prime divisors removes exactly those residues not coprime to .
For , the formula gives , corresponding to . It gives and shows that the Euler totient function is multiplicative on coprime integers. For , the empty product gives .
New to topics? Read the docs here!