If and are coprime, every divisor of is uniquely with and . Hence, for a multiplicative arithmetic function ,
The Möbius function is if a prime square divides , and if is a product of distinct primes. The Euler totient function counts residues modulo coprime to . From the prime factorizations,
Both sides of the second identity are multiplicative, and at a prime power ,
Therefore

Articles by others on the same topic (0)

There are currently no matching articles.