Skewes' number

In number theory, Skewes' number can refer to 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 :π("x") > li("x"),where π("x") is the prime-counting function and li("x") is the logarithmic integral function. The numbers found by Skewes are now only of historical interest, because computer calculations have produced much smaller estimates. As of 2007, these calculations suggest that the smallest such "x" is close to 1.397 × 10³¹⁶.

kewes' numbers

John Edensor Littlewood, Skewes' teacher, proved in harv|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") is always less than li("x"), though mathematicians familiar with Riemann's work on the Riemann zeta function would probably have realized that occasional exceptions were likely by the argument given below (and the claim sometimes made that Littlewood's result was a big surprise to experts seems doubtful). Littlewood's proof did not, however exhibit a concrete such number "x"; it was not an effective result.

harvtxt|Skewes|1933 proved that, assuming that the Riemann hypothesis is true, there exists a number "x" violating π("x") < li("x") below : $e^{e^{e^{79}$ (now sometimes called first Skewes' number), which is approximately equal to : $10^{10^{8.85 imes 10^{33}$ .

In harv|Skewes|1955, without assuming the Riemann hypothesis, he managed to prove that there must exist a value of "x" below : $10^{10^{10^{963}$ (sometimes called second Skewes' number).

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. The approach called "unwinding" in proof theory looks directly at proofs and their structure to produce bounds. The other way, more often seen in practice in number theory, changes proof structure enough so that absolute constants can be made more explicit.

Skewes' result was celebrated partly because the proof structure used excluded middle, which is not "a priori" a constructive argument (it divides into two cases, and it is not computable in which case one is working).Although both Skewes numbers are big compared to most numbers encountered in mathematical proofs, neither is anywhere near as big as Graham's number.

More recent estimates

These (enormous) 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 harvtxt|Lehman|1966, whoshowed 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, harvs|txt=yes|authorlink=H. J. J. te Riele|first=H. J. J.|last= te Riele |year= 1987 proved an upper bound of 7e|370. A better estimation was 1.39822e|316 discovered by harvtxt|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³¹¹. harvtxt|Chao|Plymen|2005 gave a small improvement and correction to the result of Bays and Hudson. harvtxt|Demichel|2005 suggested that the first crossover point is near the slightly smaller value 1.397162914×10³¹⁶, though as of|2007|lc=on his work has not been published or independently checked. 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, thoughcomputer calculations suggest they are unlikely to exist. Rigorously, harvtxt|Rosser|Schoenfeld|1962 proved that there are no crossover points below "x" = 10⁸, and this lower bound was subsequently improved by harvtxt|Brent|1975 to 8e|10, and by harvtxt|Kotnik|2008 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.

harvtxt|Wintner|1941 showed that the proportion of integers for which π("x")>li("x") is positive, and harvtxt|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): $pi(x) = operatorname{li}(x) - operatorname{li}(sqrt{x})/2 - sum_
ho operatorname{li}(x^
ho)$ + smaller termsspecify|How much smaller? Big-O notation would be useful here.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(radic|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(radic|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 assume the zeros of the Riemann zeta function are random which is not true. Roughly speaking, Littlewood's proof consists of showing that in some sense the zeros are "sufficiently random" for this argument to work.

In the unlikely 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 li("x"^1/2)/2 is that, roughly speaking, li("x") is counting not primes, but primes powers "p"^"n" weighted by 1/"n", and li("x"^1/2)/2 is a sort of correction term coming from squares of primes.

References

External links

*citation|url=http://www.mybloop.com/dmlpat/maths/li_crossover_pi.pdf|title= The prime counting function and related subjects|version= 3.1415
accessdate= 2007 November 4|year=2005
first= Patrick|last= Demichel Contains many graphs of the difference π(x) − li(x) near crossover points.

Wikimedia Foundation. 2010.

Игры ⚽ Нужен реферат?

Look at other dictionaries:

Skewes-Zahl — Die Skewes Zahl (nach Stanley Skewes) ist eine obere Grenze für das Problem der überschätzten Primzahldichte. Ihr genauer Wert beträgt . Auch die Approximation ist gebräuchlich. Inhaltsverzeichnis 1 Geschichte 2 Literatur … Deutsch Wikipedia
Skewes — Stanley Skewes (* 1899; † 1988) war ein südafrikanischer Mathematiker mit englischen Wurzeln. Nach ihm ist die Skewes Zahl benannt, die in der Theorie der Primzahlen eine Rolle spielt und die man zu den größten Zahlen rechnet, die für die… … Deutsch Wikipedia
Nombre de Skewes — En mathématiques, plus précisément en théorie des nombres, le nombre de Skewes peut faire référence à plusieurs nombres extrêmement grands utilisés par le mathématicien sud africain Stanley Skewes (en). Par définition, le nombre est le plus… … Wikipédia en Français
Stanley Skewes — (* 1899; † 1988) war ein südafrikanischer Mathematiker mit englischen Wurzeln. Nach ihm ist die Skewes Zahl benannt, die in der Theorie der Primzahlen eine Rolle spielt und die man früher zu den größten natürlichen Zahlen rechnete, die für die… … Deutsch Wikipedia
Stanley Skewes — (1899–1988) was a South African mathematician, best known for his discovery of Skewes number in 1933. He was one of John Edensor Littlewood s students at Cambridge University.Publications* S. Skewes: On the difference pi;( x ) − Li( x ) , Journal … Wikipedia
Prime number theorem — PNT redirects here. For other uses, see PNT (disambiguation). In number theory, the prime number theorem (PNT) describes the asymptotic distribution of the prime numbers. The prime number theorem gives a general description of how the primes are… … Wikipedia
List of number theory topics — This is a list of number theory topics, by Wikipedia page. See also List of recreational number theory topics Topics in cryptography Contents 1 Factors 2 Fractions 3 Modular arithmetic … Wikipedia
Graham's number — Graham s number, named after Ronald Graham, is a large number that is an upper bound on the solution to a certain problem in Ramsey theory. This number gained a degree of popular attention when Martin Gardner described it in the Mathematical… … Wikipedia
Effective results in number theory — For historical reasons and in order to have application to the solution of Diophantine equations, results in number theory have been scrutinised more than in other branches of mathematics to see if their content is effectively computable. Where… … Wikipedia
Large numbers — This article is about large numbers in the sense of numbers that are significantly larger than those ordinarily used in everyday life, for instance in simple counting or in monetary transactions. The term typically refers to large positive… … Wikipedia

Academic Dictionaries and Encyclopedias

Skewes' number

Look at other dictionaries:

Share the article and excerpts

Academic Dictionaries and Encyclopedias

Wikipedia

Skewes' number

Look at other dictionaries:

Share the article and excerpts

Direct link