Mertens' theorem
(another Prime Pages' Glossary entries)
The Prime Glossary
Glossary: Prime Pages: Top 5000:
The hardware and software on this system was updated September 4th.  Please let me know of any problem you encounter. <caldwell@utm.edu>

Mertens used Chebyshev's theorem (a weak version of the prime number theorem) to prove that

.
This is now called Mertens' Theorem.

Assuming the Riemann hypothesis, Schoenfeld showed that when x > 8, we have the following error bound

where is Euler's constant.

Related pages (outside of this work)

References:

BS96 (p. 210,234)
E. Bach and J. Shallit, Algorithmic number theory, Foundations of Computing Vol, I: Efficient Algorithms, The MIT Press, Cambridge, MA, 1996.  pp. xvi+512, MR 97e:11157 (Annotation available)



Chris K. Caldwell © 1999-2014 (all rights reserved)