The hardware and software on this system was updated September 4th. Please let me know of any problem you encounter. <firstname.lastname@example.org>
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)