Skewes's Number

In number theory, Skewes's number is the smallest natural number $x$ for which the prime-counting function $\pi(x)$ exceeds the logarithmic integral function $\operatorname(x).$ It is named for the South African mathematician Stanley Skewes who first computed an upper bound on its value.

The exact value of Skewes's number is still not known, but it is known that there is a crossing between $\pi(x) < \operatorname(x)$ and $\pi(x) > \operatorname(x)$ near $e^ < 1.397 \times 10^.$ It is not known whether this is the smallest crossing.

The name is sometimes also applied to either of the large number bounds which Skewes found.

Skewes's bounds

Although nobody has ever found a value of $x$ for which $\pi(x) > \operatorname(x),$ Skewes's research supervisor J.E. Littlewood had proved in that there is such a number (and so, a first such number); and indeed found that the sign of the difference $\pi(x) - \operatorname(x)$ changes infinitely many times. Littlewood's proof did not, however, exhibit a concrete such number $x$, nor did it even give any bounds on the value.

Skewes's task was to make Littlewood's existence proof effective: exhibit some concrete upper bound for the first sign change. According to Georg Kreisel, this was not considered obvious even in principle at the time. quotes A. E. Ingham (1932) and J. E. Littlewood (1948) as stating "that the proof was believed to be 'non-constructive', or to require 'new ideas' of proof to make it constructive."

proved that, assuming that the Riemann hypothesis is true, there exists a number $x$ violating $\pi(x) < \operatorname(x),$ below
:$e^<10^.$

Without assuming the Riemann hypothesis, later proved that there exists a value of $x$ below
:$e^<10^.$

More recent bounds

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 , who showed that somewhere between $1.53\times 10^$ and $1.65\times 10^$ there are more than $10^$ consecutive integers $x$ with $\pi(x) > \operatorname(x)$.
Without assuming the Riemann hypothesis, proved an upper bound of $7\times 10^$. A better estimate was $1.39822\times 10^$ discovered by , who showed there are at least $10^$ consecutive integers somewhere near this value where $\pi(x) > \operatorname(x)$. Bays and Hudson found a few much smaller values of $x$ where $\pi(x)$ gets close to $\operatorname(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. gave a small improvement and correction to the result of Bays and Hudson. found a smaller interval for a crossing, which was slightly improved by . The same source shows that there exists a number $x$ violating $\pi(x) < \operatorname(x),$ below $e^< 1.39718 \times 10^$. This can be reduced to $e^< 1.39717 \times 10^$ assuming the Riemann hypothesis. conducted an analysis with up to 2 complex zeros which gives computational evidence that a crossover may exist near $1.397162914 \times 10^$.

Rigorously, proved that there are no crossover points below $x = 10^8$, improved by to $8\times 10^$, by to $10^$, by to $1.39\times 10^$, and by to $10^$.

There is no explicit value $x$ known for certain to have the property $\pi(x) > \operatorname(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 $\pi(x) > \operatorname(x)$ does not exist, showed that the logarithmic density of these positive integers does exist and is positive. showed that this proportion is about , 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 $\pi(x)$, whose leading terms are (ignoring some subtle convergence questions)

:$\pi(x) = \operatorname(x) - \tfrac\operatorname(\sqrt) - \sum_ \operatorname(x^\rho) + \text$
where the sum is over all $\rho$ in the set of non-trivial zeros of the Riemann zeta function.

The largest error term in the approximation $\pi(x) \approx \operatorname(x)$ (if the Riemann hypothesis is true) is negative $\tfrac\operatorname(\sqrt)$, showing that $\operatorname(x)$ is usually larger than $\pi(x)$. The other terms above are somewhat smaller, and moreover tend to have different, seemingly random complex arguments, so mostly cancel out. Occasionally however, several 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 $\tfrac\operatorname(\sqrt)$.

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 $\pi(x)$ is sometimes larger than $\operatorname(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 $\operatorname(x^)$ for zeros violating the Riemann hypothesis (with real part greater than ) are eventually larger than $\operatorname(x^)$.

The reason for the term $\tfrac\mathrm(x^)$ is that, roughly speaking, $\mathrm(x)$ actually counts powers of primes, rather than the primes themselves, with $p^n$ weighted by $\frac$. The term $\tfrac\mathrm(x^)$ is roughly analogous to a second-order correction accounting for squares of primes.

Equivalent for prime ''k''-tuples

An equivalent definition of Skewes's number exists for prime ''k''-tuples (). Let $P = (p, p+i_1, p+i_2, ..., p+i_k)$ denote a prime (''k'' + 1)-tuple, $\pi_P(x)$ the number of primes $p$ below $x$ such that $p, p+i_1, p+i_2, ..., p+i_k$ are all prime, let $\operatorname(x) = \int_2^x \frac$ and let $C_P$ denote its Hardy–Littlewood constant (see First Hardy–Littlewood conjecture). Then the first prime $p$ that violates the Hardy–Littlewood inequality for the (''k'' + 1)-tuple $P$, i.e., the first prime $p$ such that
: $\pi_P(p) > C_P \operatorname_P(p),$
(if such a prime exists) is the ''Skewes number for $P.$''

The table below shows the currently known Skewes numbers for prime ''k''-tuples:

The Skewes number (if it exists) for sexy primes $(p, p+6)$ is still unknown.

It is also unknown whether all admissible ''k''-tuples have a corresponding Skewes number.

See also

*

References

*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*
*.
*
*.
*

External links

*
*

{{Large numbers

Large numbers
Number theory
Large integers