
Glossary: Prime Pages: Top 5000: 
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:
Chris K. Caldwell © 19992014 (all rights reserved)
