MathCastle
Number TheoryEasyArithmetic Functions

Arithmetic Functions · Easy problem

The Möbius function is μ(n)=0\mu(n) = 0 if nn has a repeated prime factor, and μ(n)=(−1)k\mu(n) = (-1)^k if nn is a product of kk distinct primes. Find μ(42)\mu(42).