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.

16 Chapter 1 PRIMES!<br />

Let’s hear it for heuristic reasoning! Very recently P. Sebah found<br />

16<br />

π2 10 = 10304195697298,<br />

as enunciated in [Gourdon and Sebah 2004].<br />

As strong as the numerical evidence may be, we still do not even know<br />

whether there are infinitely many pairs of twin primes; that is, whether π2(x)is<br />

unbounded. This remains one of the great unsolved problems in mathematics.<br />

The closest we have come to proving this is the theorem of Chen Jing-run<br />

in 1966, see [Halberstam and Richert 1974], that there are infinitely many<br />

primes p such that either p + 2 is prime or the product of two primes.<br />

A striking upper bound result on twin primes was achieved in 1915 by<br />

V. Brun, who proved that<br />

<br />

2<br />

ln ln x<br />

π2(x) =O x<br />

, (1.8)<br />

ln x<br />

and a year later he was able to replace the expression ln ln x with 1<br />

(see [Halberstam and Richert 1974]). Thus, in some sense, the twin prime<br />

conjecture (1.7) is partially established. From (1.8) one can deduce (see<br />

Exercise 1.50) the following:<br />

Theorem 1.2.1 (Brun). The sum of the reciprocals of all primes belonging<br />

to some pair of twin primes is finite, that is, if P2 denotes the set of all primes<br />

p such that p +2 is also prime, then<br />

<br />

<br />

1 1<br />

+ < ∞.<br />

p p +2<br />

p∈P2<br />

(Note that the prime 5 is unique in that it appears in two pairs of twins,<br />

and in its honor, it gets counted twice in the displayed sum; of course, this<br />

has nothing whatsoever to do with convergence or divergence.) The Brun<br />

theorem is remarkable, since we know that the sum of the reciprocals of all<br />

primes diverges, albeit slowly (see Section 1.1.5). The sum in the theorem,<br />

namely<br />

B ′ =(1/3+1/5) + (1/5+1/7) + (1/11 + 1/13) + ···,<br />

is known as the Brun constant. Thus, though the set of twin primes may well<br />

be infinite, we do know that they must be significantly less dense than the<br />

primes themselves.<br />

An interesting sidelight on the issue of twin primes is the numerical<br />

calculation of the Brun constant B ′ . There is a long history on the subject,<br />

with the current computational champion being Nicely. According to the<br />

paper [Nicely 2004], the Brun constant is likely to be about<br />

B ′ ≈ 1.902160583,

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

Saved successfully!

Ooh no, something went wrong!