Skewes' number

In number theory, Skewes' number is any of several extremely large numbers used by the South African mathematician Stanley Skewes as upper bounds for the smallest natural number x for which

where π is the prime-counting function and li is the logarithmic integral function. These bounds have since been improved by others: there is a crossing near . It is not known whether it is the smallest.

Skewes' numbers

John Edensor Littlewood, who was Skewes' research supervisor, had proved in Littlewood (1914) that there is such a number (and so, a first such number); and indeed found that the sign of the difference π(x) − li(x) changes infinitely often. All numerical evidence then available seemed to suggest that π(x) was always less than li(x). Littlewood's proof did not, however, exhibit a concrete such number x.

Skewes (1933) proved that, assuming that the Riemann hypothesis is true, there exists a number x violating π(x) < li(x) below

In Skewes (1955), without assuming the Riemann hypothesis, Skewes was able to prove that there must exist a value of x below

Skewes' task was to make Littlewood's existence proof effective: exhibiting some concrete upper bound for the first sign change. According to George Kreisel, this was at the time not considered obvious even in principle.

More recent estimates

These upper bounds have since been reduced considerably by using large scale computer calculations of zeros of the Riemann zeta function. The first estimate for the actual value of a crossover point was given by Lehman (1966), who showed that somewhere between 1.53×10¹¹⁶⁵ and 1.65×10¹¹⁶⁵ there are more than 10⁵⁰⁰ consecutive integers x with π(x) > li(x). Without assuming the Riemann hypothesis, H. J. J. te Riele (1987) proved an upper bound of 7×10³⁷⁰. A better estimation was 1.39822×10³¹⁶ discovered by Bays & Hudson (2000), who showed there are at least 10¹⁵³ consecutive integers somewhere near this value where π(x) > li(x), and suggested that there are probably at least 10³¹¹. Chao & Plymen (2010) gave a small improvement and correction to the result of Bays and Hudson. Bays and Hudson found a few much smaller values of x where π(x) gets close to li(x); the possibility that there are crossover points near these values does not seem to have been definitely ruled out yet, though computer calculations suggest they are unlikely to exist. Saouter & Demichel (2010) find a smaller interval for a crossing, which was slightly improved by Zegowitz (2010). The same source shows that there exists a number x violating π(x) < li(x) below . The exponent could be reduced to 727.951338611, assuming Riemann hypothesis.

Rigorously, Rosser & Schoenfeld (1962) proved that there are no crossover points below x = 10⁸, and this lower bound was subsequently improved by Brent (1975) to 8×10¹⁰, by Kotnik (2008) to 10¹⁴, by Platt & Trudgian (2014) to 1.39×10¹⁷, and by Büthe (2015) to 10¹⁹.

There is no explicit value x known for certain to have the property π(x) > li(x), though computer calculations suggest some explicit numbers that are quite likely to satisfy this.

Even though the natural density of the positive integers for which π(x) > li(x) doesn't exist, Wintner (1941) showed that the logarithmic density of these positive integers does exist and is positive. Rubinstein & Sarnak (1994) showed that this proportion is about .00000026, which is surprisingly large given how far one has to go to find the first example.

Riemann's formula

Riemann gave an explicit formula for π(x), whose leading terms are (ignoring some subtle convergence questions)

where the sum is over zeros ρ of the Riemann zeta function. The largest error term in the approximation π(x) = li(x) (if the Riemann hypothesis is true) is li(√x)/2, showing that li(x) is usually larger than π(x). The other terms above are somewhat smaller, and moreover tend to have different complex arguments so mostly cancel out. Occasionally however, many of the larger ones might happen to have roughly the same complex argument, in which case they will reinforce each other instead of cancelling and will overwhelm the term li(√x)/2. The reason why the Skewes number is so large is that these smaller terms are quite a lot smaller than the leading error term, mainly because the first complex zero of the zeta function has quite a large imaginary part, so a large number (several hundred) of them need to have roughly the same argument in order to overwhelm the dominant term. The chance of N random complex numbers having roughly the same argument is about 1 in 2^N. This explains why π(x) is sometimes larger than li(x), and also why it is rare for this to happen. It also shows why finding places where this happens depends on large scale calculations of millions of high precision zeros of the Riemann zeta function. The argument above is not a proof, as it assumes the zeros of the Riemann zeta function are random which is not true. Roughly speaking, Littlewood's proof consists of Dirichlet's approximation theorem to show that sometimes many terms have about the same argument.

In the event that the Riemann hypothesis is false, the argument is much simpler, essentially because the terms li(x^ρ) for zeros violating the Riemann hypothesis (with real part greater than 1/2) are eventually larger than li(x^1/2).

The reason for the term is that, roughly speaking, counts not primes, but powers of primes weighted by , and is a sort of correction term coming from squares of primes.

References

External links

• The prime counting function and related subjects by Patrick Demichels (retrieved 2009-09-29)