Search results
Results from the WOW.Com Content Network
In mathematics, the Mertens conjecture is the statement that the Mertens function is bounded by . 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 ...
The Mertens conjecture went further, stating that there would be no x where the absolute value of the Mertens function exceeds the square root of x. The Mertens conjecture was proven false in 1985 by Andrew Odlyzko and Herman te Riele. However, the Riemann hypothesis is equivalent to a weaker conjecture on the growth of M(x), namely M(x) = O(x ...
The Mertens function M(x) is the sum function for the Möbius function, in the theory of arithmetic functions. The Mertens conjecture concerning its growth, conjecturing it bounded by x 1/2, which would have implied the Riemann hypothesis, is now known to be false (Odlyzko and te Riele, 1985).
Legendre's argument is heuristic; and Chebyshev's proof, although perfectly sound, makes use of the Legendre-Gauss conjecture, which was not proved until 1896 and became better known as the prime number theorem. Mertens' proof does not appeal to any unproved hypothesis (in 1874), and only to elementary real analysis.
Conjecture Field Comments Eponym(s) Cites 1/3–2/3 conjecture: order theory: n/a: 70 abc conjecture: number theory: ⇔Granville–Langevin conjecture, Vojta's conjecture in dimension 1 ⇒Erdős–Woods conjecture, Fermat–Catalan conjecture Formulated by David Masser and Joseph Oesterlé. [1] Proof claimed in 2012 by Shinichi Mochizuki: n/a ...
Hermanus Johannes Joseph te Riele (born 5 January 1947) is a Dutch mathematician at CWI in Amsterdam with a specialization in computational number theory. He is known for proving the correctness of the Riemann hypothesis for the first 1.5 billion non-trivial zeros of the Riemann zeta function with Jan van de Lune and Dik Winter, for disproving the Mertens conjecture with Andrew Odlyzko, and ...
With János Komlós and Endre Szemerédi, he disproved the Heilbronn conjecture. [5] With Iwaniec, he proved that for sufficiently large n there is a prime between n and n + n 23/42. [6] Pintz gave an effective upper bound for the first number for which the Mertens conjecture fails. [7]
Cramér's conjecture; Riemann hypothesis. Critical line theorem; Hilbert–Pólya conjecture; Generalized Riemann hypothesis; Mertens function, Mertens conjecture, Meissel–Mertens constant; De Bruijn–Newman constant; Dirichlet character; Dirichlet L-series. Siegel zero; Dirichlet's theorem on arithmetic progressions. Linnik's theorem ...