Tighter bounds in the prime number theorem
The Endeavour 2026-01-16
Summary:
The most elementary form of the prime number theorem says that π(x), the number of prime numbers less than x, is asymptotically equal to x / log(x). That’s true, but a more accurate result says π(x) is asymptotically equal to li(x) where Five years ago I wrote about a result that was new at the […]
The post Tighter bounds in the prime number theorem first appeared on John D. Cook.