10.12.2012 Views

Prime Numbers

Prime Numbers

Prime Numbers

SHOW MORE
SHOW LESS

Create successful ePaper yourself

Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.

1.1 Problems and progress 11<br />

is that for random large integers x the “probability” that x is prime is about<br />

1/ ln x.<br />

It is interesting to ponder how Gauss arrived at his remarkable conjecture.<br />

Thestorygoesthathecameacrosstheconjecturenumerically,bystudyinga<br />

table of primes. Though it is clearly evident from tables that the primes thin<br />

out as one gets to larger numbers, locally the distribution appears to be quite<br />

erratic.SowhatGaussdidwastocountthenumberofprimesinblocksof<br />

length 1000. This smoothes out enough of the irregularities (at low levels) for<br />

a “law” to appear, and the law is that near x, the “probability” of a random<br />

integer being prime is about 1/ ln x. This then suggested to Gauss that a<br />

reasonable estimate for π(x) might be the logarithmic-integral function.<br />

Though Gauss’s thoughts on π(x) date from the late 1700s, he did not<br />

publish them until decades later. Meanwhile, Legendre had independently<br />

conjectured the PNT, but in the form<br />

π(x) ∼<br />

x<br />

ln x − B<br />

(1.4)<br />

with B =1.08366. No matter what choice is made for the number B, wehave<br />

x/ ln x ∼ x/(ln x − B), so the only way it makes sense to include a number<br />

B in the result, or to use Gauss’s approximation li (x), is to consider which<br />

option gives a better estimation. In fact, the Gauss estimate is by far the better<br />

one. Equation (1.2) implies that |π(x) − li (x)| = O(x/ ln k x) for every k>0<br />

(where the big-O constant depends on the choice of k). Since<br />

li (x) = x x<br />

+<br />

ln x ln 2 <br />

x<br />

+ O<br />

x ln 3 <br />

,<br />

x<br />

it follows that the best numerical choice for B in (1.4) is not Legendre’s choice,<br />

but B = 1. The estimate<br />

x<br />

π(x) ≈<br />

ln x − 1<br />

is attractive for estimations with a pocket calculator.<br />

One can gain insight into the sharpness of the li approximation by<br />

inspecting a table of prime counts as in Table 1.1.<br />

For example, consider x = 10 21 . We know from a computation<br />

of X. Gourdon (based on earlier work of M. Deléglise, J. Rivat, and<br />

P. Zimmermann) that<br />

while on the other hand<br />

and<br />

π 10 21 = 21127269486018731928,<br />

li 10 21 ≈ 21127269486616126181.3<br />

1021 ln(1021 ≈ 21117412262909985552.2 .<br />

) − 1

Hooray! Your file is uploaded and ready to be published.

Saved successfully!

Ooh no, something went wrong!