MathOverflow is a question and answer site for professional mathematicians. Join them; it only takes a minute:

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

Could someone please provide information about the best possible known bounds of the sum $$A(x)=\sum_{n\leq x}\frac{\mu(n)}{n}?$$ Unconditionally, $A(x)=O(e^{-c\sqrt{\log x}})$ is known to me. Does there exist any better bound conditionally or unconditionally?

I am expecting a result like $A(x)=O(\frac1{\sqrt x})$ if Riemann Hypothesis is assumed. Is this true? What I could get is up on truth of RH $A(x)=O(x^{-1/2+\epsilon})$, which is not very hard to prove.

Any reference regarding conditional (RH) bound of $A(x)$ will be highly appreciated. Thanks.

share|cite|improve this question
You probably meant to write $A(x)=O(\exp(-c\sqrt{\log x}))$ unconditionally. The Vinogradov zero-free region should improve that to $O(\exp(-(\log x)^{\frac 23-\epsilon}))$ (indeed something a little more precise). Mark Lewko has supplied the best known result on RH – Lucia Jan 6 '14 at 3:49
Thanks for pointing out that typo. – Subhajit Jana Jan 6 '14 at 4:44
up vote 11 down vote accepted

As Alexey has pointed out the problem can be reduced, via summation by parts, to understanding the asymptotic of Mertens' sum $$M(x) := \sum_{n\leq x} \mu(n).$$ Conditional on the Riemann hypothesis, the best bound to date on Mertens' sum, due to Soundararajan in 2009, is $$M(x) \ll x^{1/2} e^{(\log(x))^{1/2} (\log\log(x))^{14}}.$$ In particular, this implies $$\sum_{n\leq x} \frac{\mu(n)}{n} \ll \frac{e^{(\log(x))^{1/2} (\log\log(x))^{14}}}{x^{1/2}}.$$

share|cite|improve this answer
Using Soundararajan's method, the power of $\log\log x$ in this estimate has been improved by Balazard & Roton: – Micah Milinovich Jan 6 '14 at 15:30

See Mertens conjecture. Summation by parts gives your sum from Mertens conjecture.

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.