Mertens conjecture

From Wikipedia, the free encyclopedia

In mathematics, the Mertens conjecture is a statement about the behavior of a certain function as its argument increases. Conjectured to be true by Mertens in 1897, it was disproved in 1985. The Mertens conjecture would have proved that the Riemann hypothesis was also true.

Contents 1 Definition 2 Disproof of the conjecture 3 Connection to the Riemann hypothesis 4 References

[edit] Definition

In number theory, if we define the Mertens function as

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

[edit] Disproof of the conjecture

Stieltjes claimed in 1885 to have proven a weaker result, namely that was bounded, but did not publish a proof.

In 1985, Odlyzko and te Riele proved the Mertens conjecture false. It was later shown that the first counterexample appears below exp(3.21 × 10⁶⁴) (Pintz 1987) but above 10¹⁴ (Kotnik and van de Lune 2004). The upper bound has since been lowered to exp(1.59 × 10⁴⁰) (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 2009^[update]). 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^1/2 log log n, which suggests that the order of growth of M(n)/n^1/2 might be somewhere around log log n.

[edit] Connection to the Riemann hypothesis

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(x^e) 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 .

[edit] References

• T. Kotnik and H.J.J. te Riele (2006), "The Mertens Conjecture Revisited", Lecture Notes in Computer Science 4076 (Proceedings of the 7th Algorithmic Number Theory Symposium), pp. 156-167.
• T. Kotnik and J. van de Lune (2004), "On the order of the Mertens function", Experimental Mathematics 13, pp. 473-481
• F. Mertens (1897), "Über eine zahlentheoretische Funktion", Sitzungsberichte der Kaiserlichen Akademie der Wissenschaften, Mathematisch-Naturwissenschaftliche Klasse, Abteilung 2a, 106, pp. 761-830.
• A. M. Odlyzko and H.J.J. te Riele (1985), "Disproof of the Mertens Conjecture", Journal für die reine und angewandte Mathematik 357, pp. 138-160.
• J. Pintz (1987), "An effective disproof of the Mertens conjecture", Astérisque 147-148, pp. 325-333.
• Weistein, Eric W., "Mertens conjecture" from MathWorld.