Exercise 995Combinatorics › Inclusion-exclusionL1Added 3 Nov 2026
Euler's totient via inclusion-exclusion
#Euler totient#IE#coprime
Statement
Show that using inclusion-exclusion.
Hint
Count integers divisible by at least one prime divisor .
Show solutionHide solution
Solution
Sets. For each prime , multiples of in ; .
IE. Number coprime to = minus those in the union:
Conclusion. .