The first Skewes number, written \(Sk_1\), is an upper bound for the least number \(n\) such that \(\pi(n) > li(n)\) is true, where \(\pi(n)\) is the prime counting function and \(li(n)\) is the logarithmic integral. This bound was first proven assuming the Riemann hypothesis. It's equal to \(e^{e^{e^{79}}} \approx 10^{10^{10^{34}}}\). As of now, it is known that the least example \(n\) of \(\pi(n) > li(n)\) must lie between \(10^{14}\) and \(1.4 \cdot 10^{316}\).
Attributes | Values |
---|---|
rdfs:label |
|
rdfs:comment |
|
dcterms:subject | |
dbkwik:googology/p...iPageUsesTemplate | |
abstract |
|