Tighter bounds in the prime number theorem (opens in new tab)

<p>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&#8217;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 [&#8230;]</p> The post <a href="https://www.johndcook.com/blog/2026/01/16/prime-number-theorem-bounds/">Tighter bounds in the prime number theorem</a> first appeared on <a href="https://www.jo...