Skewes’ number

Skewes’ number is the smallest number $n$ for which $\pi (n)>\mathrm{li}(n)$, where $\pi (x)$ is the prime counting function and $\mathrm{li}(x)$ is the logarithmic integral. The logarithmic integral is a good estimate for the prime counting function, but in the range of prime numbers for which we know all smaller primes, the logarithmic integral is an overestimate. Thus, Skewes’ number is the smallest number for which $\mathrm{li}(x)$ “goes from being an overestimate to being an underestimate.” (Wells, 1986)

The exact value of Skewes’ number is not currently known. Stanley Skewes in 1933 gave the lower bound $e^{e^{e^{79}}}$, approximately ${10}^{{10}^{{10}^{34}}}$. He assumed the Riemann hypothesis to be true. Others have proven smaller bounds to as low as about $1.4\times {10}^{316}$.

In the 1930s, Skewes’ number was the largest that had ever been used in a serious mathematical proof. It has since then been significantly dwarfed by Graham’s number. It still is the second largest number with its own entry in Wells’ The Penguin Dictionary of Curious and Interesting Numbers, appearing on the penultimate page of the main text.

Title	Skewes’ number
Canonical name	SkewesNumber
Date of creation	2013-03-22 17:02:58
Last modified on	2013-03-22 17:02:58
Owner	PrimeFan (13766)
Last modified by	PrimeFan (13766)
Numerical id	5
Author	PrimeFan (13766)
Entry type	Definition
Classification	msc 11A41
Synonym	Skewes’s number
Synonym	Skewes number