Exercise · ZW-MOBIUS-FUNCTION-009 · ★☆☆ Basic
If \(p\) is prime and \(k\ge 2\), what is \(\mu(p^k)\)?
Choose one option.
Show answer
- B. 0
Explanation
\(p^k\) has the prime \(p\) repeated, so \(\mu(p^k)=0\) regardless of \(p\) or \(k\).
Review the concept: Möbius function
The Möbius function \(\mu(n)\) is an arithmetic function: it equals \(1\) if \(n=1\), \((-1)^k\) if \(n\) is a product of \(k\) distinct primes, and \(0\) if \(n\) has a repeated prime factor.
\[\sum_{d\mid n}\mu(d)=\begin{cases}1 & n=1\\ 0 & n>1\end{cases}\]
More practice problems: möbius function
- ZW-MOBIUS-FUNCTION-001 What is μ(1)?
- ZW-MOBIUS-FUNCTION-002 What is μ(7)?
- ZW-MOBIUS-FUNCTION-003 Which of these numbers has μ(n)≠ 0?
- ZW-MOBIUS-FUNCTION-004 If n is a product of 4 distinct primes, what is μ(n)?
- ZW-MOBIUS-FUNCTION-005 How many positive divisors of 12 satisfy μ(d)≠ 0?
- ZW-MOBIUS-FUNCTION-006 You know that g(n)=∑_d| n f(d) for every n, with g(1)=2, g(2)=5, g(3)=4 and g(6)=9. What is f(6)?
- ZW-MOBIUS-FUNCTION-007 What is μ(10)·μ(3)?
- ZW-MOBIUS-FUNCTION-008 Which of these statements about μ is false?