Mertens conjecture
In mathematics, the Mertens conjecture is the statement that the Mertens function
Although now disproven, it had been shown to imply the Riemann hypothesis.
It was conjectured by Thomas Joannes Stieltjes, in an 1885 letter to Charles Hermite (reprinted in Stieltjes (1905)), and again in print by Franz Mertens (1897), and disproved by Andrew Odlyzko and Herman te Riele (1985).
It is a striking example of a mathematical conjecture proven false despite a large amount of computational evidence in its favor.
In number theory, the Mertens function is defined as where μ(k) is the Möbius function; the Mertens conjecture is that for all n > 1, Stieltjes claimed in 1885 to have proven a weaker result, namely that
was bounded, but did not publish a proof.
, the Mertens conjecture is that
In 1985, Andrew Odlyzko and Herman te Riele proved the Mertens conjecture false using the Lenstra–Lenstra–Lovász lattice basis reduction algorithm:[2][3] It was later shown that the first counterexample appears below
[5] The upper bound has since been lowered to
[7] In 2024, Seungki Kim and Phong Nguyen lowered the bound to
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, which suggests that the order of growth of m(n) might be somewhere around √log log n. The actual order of growth may be somewhat smaller; in the early 1990s Steve Gonek conjectured[9] that the order of growth of m(n) was
which was affirmed by Ng (2004), based on a heuristic argument, that assumed the Riemann hypothesis and certain conjectures about the averaged behavior of zeros of the Riemann zeta function.
[9] In 1979, Cohen and Dress[10] found the largest known value of
for M(7766842813) = 50286, and in 2011, Kuznetsov found the largest known negative value (largest in the sense of absolute value)
[11] In 2016, Hurst computed M(n) for every n ≤ 1016 but did not find larger values of m(n).
[5] 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.[12] In 2016, Hurst made further improvements by showing 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
