Exercise 1650Number theory › Divisibility and gcdL1Added 3 Nov 2026
Euler's totient function
#Euler totient#coprime#formula
Statement
Show that where counts integers with .
Hint
Use inclusion-exclusion on multiples of the prime divisors of .
Show solutionHide solution
Solution
Inclusion-exclusion. The number of integers in coprime to equals minus those divisible by some prime . By inclusion-exclusion:
Conclusion. The product formula holds.
Example. (the integers ).