Refinements to the prime number theorem
( go to the article → https://www.johndcook.com/blog/2020/11/23/refinedpntbound/ )
Let π(x) be the number of primes less than x. The simplest form of the prime number theorem says that π(x) is asymptotically equal to x/log(x), where log means natural logarithm. That is, This means that in the limit as x goes to infinity, the relative error in approximating π(x) with x/log(x) goes to 0. […]
The post Refinements to the prime number theorem first appeared on John D. Cook.
Nov. 23, 2020, 2 p.m.
You may be interested in:
Newest in: Math
Zeros of trigonometric polynomials
Bootstrapping a minimal math library
Newest in: Number Theory
