Mathematics Stack Exchange is a question and answer site for people studying math at any level and professionals in related fields. It's 100% free, no registration required.

Sign up
Here's how it works:
  1. Anybody can ask a question
  2. Anybody can answer
  3. The best answers are voted up and rise to the top

The problem is: prove that $$\sum_{d|n} \mu(d) \log^m(d) = 0$$ if $m \ge 1$ and $n$ has more than $m$ distinct prime factors. Here, $\mu$ is the Möbius function.

This is from a book I'm self studying from, and it hints to use induction. I prove the identity for $m = 1$ by using the fact that $$\Lambda(n) = -\sum_{d|n} \mu(d) \log(d)$$ and the definition of the Mangoldt function, $\Lambda$. I then fiddled around with the sum for a bit to try to prove the inductive step, but I haven't managed to get anywhere useful.

Hints would be preferable to answers, but I'm happy to have either.

share|cite|improve this question
up vote 2 down vote accepted

Hint: Let $p$ be a prime factor of $n$. Write $n=p^as$, where $a \geq 1, p \nmid s$. Split up the sum into $$\sum_{d \mid s}{\mu(d)\log^m(d)}+\sum_{d\mid s}{\mu(pd)\log^m(pd)}$$ and recombine to get a sum over $d \mid s$, where $s$ has $>m-1$ prime factors. You still need to do some work before you can apply the induction hypothesis.

share|cite|improve this answer

Your Answer


By posting your answer, you agree to the privacy policy and terms of service.

Not the answer you're looking for? Browse other questions tagged or ask your own question.