Mertens conjecture

From Wikipedia, the free encyclopedia
Jump to: navigation, search
The graph shows the Mertens function M(n) and the square roots ±√n for n ≤ 10,000. After computing these values Mertens conjectured that the modulus of M(n) is always bounded by √n. This hypothesis, known as Mertens conjecture, was disproved in 1985 by Andrew Odlyzko and Herman te Riele

In mathematics, the Mertens conjecture is the false statement that the Mertens function M(n) is bounded by √n, which implies the Riemann hypothesis. It was conjectured by Thomas Joannes Stieltjes in an 1885 letter to Charles Hermite (reprinted in Stieltjes 1905) and Mertens (1897), and disproved by Odlyzko & te Riele (1985). It is a striking example of a mathematical proof contradicting a large amount of computational evidence in favor of a conjecture.


In number theory, we define the Mertens function as

where μ(k) is the Möbius function; the Mertens conjecture is that for all n > 1,

Disproof of the conjecture[edit]

Stieltjes claimed in 1885 to have proven a weaker result, namely that was bounded, but did not publish a proof.[1] (In terms of , the Mertens conjecture is that .)

In 1985, Andrew Odlyzko and Herman te Riele conditionally proved the Mertens conjecture false: indeed, and .[2][3] It was later shown that the first counterexample appears below exp(3.21×1064) (~101.39×1064) (Pintz 1987) but above 1014.[4] The upper bound has since been lowered to exp(1.59×1040) (Kotnik and Te Riele 2006), but no counterexample is explicitly known. The boundedness claim made by Stieltjes, while remarked upon as "very unlikely" in the 1985 paper cited above, has not been disproven (as of 2017). The law of the iterated logarithm states that if μ is replaced by a random sequence of +1s and −1s then the order of growth of the partial sum of the first n terms is (with probability 1) about (n log log n)1/2, which suggests that the order of growth of m(n) might be somewhere around (log log n)1/2. The actual order of growth may be somewhat smaller; it was conjectured by Steve Gonek in the early 1990s that the order of growth of m(n) was , which was also conjectured by Ng (2004), based on a heuristic argument assuming the Riemann hypothesis and certain conjectures about the averaged behavior of zeros of the Riemann zeta function.[5]

In 1979, Cohen and Dress found the largest known value of for M(7766842813) = 50286, and, in 2011, Kuznetsov found the largest known negative value for M(11609864264058592345) = -1995900927.[6] In 2016, Hurst computed M(n) for every n ≤ 1016 but did not find larger values of m(n).[7]

In 2006, Kotnik and te Riele improved the upper bound and showed that there are infinitely many values of n for which m(n)>1.2184, but without giving any specific value for such an n.[8] In 2016, Hurst made further improvements by showing and .

Connection to the Riemann hypothesis[edit]

The connection to the Riemann hypothesis is based on the Dirichlet series for the reciprocal of the Riemann zeta function,

valid in the region . We can rewrite this as a Stieltjes integral

and after integrating by parts, obtain the reciprocal of the zeta function as a Mellin transform

Using the Mellin inversion theorem we now can express M in terms of 1/ζ as

which is valid for 1 < σ < 2, and valid for 1/2 < σ < 2 on the Riemann hypothesis. From this, the Mellin transform integral must be convergent, and hence M(x) must be O(xe) for every exponent e greater than 1/2. From this it follows that

for all positive ε is equivalent to the Riemann hypothesis, which therefore would have followed from the stronger Mertens hypothesis, and follows from the hypothesis of Stieltjes that



  1. ^ Borwein, Peter; Choi, Stephen; Rooney, Brendan; et al., eds. (2007). The Riemann hypothesis. A resource for the aficionado and virtuoso alike. CMS Books in Mathematics. New York, NY: Springer-Verlag. p. 69. ISBN 978-0-387-72125-5. Zbl 1132.11047. 
  2. ^ Odlyzko & te Riele (1985)
  3. ^ Sandor et al (2006) pp.188–189
  4. ^ Kotnik, Tadej; van de Lune, Jan (November 2003). "Further systematic computations on the summatory function of the Möbius function". MAS-R0313. 
  5. ^ "The distribution of the summatory function of the Möbius function" (PDF). 
  6. ^ Kuznetsov, Eugene (2011). "Computing the Mertens function on a GPU". arXiv:1108.0135Freely accessible [math.NT]. 
  7. ^ Hurst, Greg (2016). "Computations of the Mertens Function and Improved Bounds on the Mertens Conjecture". arXiv:1610.08551Freely accessible [math.NT]. 
  8. ^ Kotnik & te Riele (2006)

Further reading[edit]