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.

14 Chapter 1 PRIMES!<br />

Erdős–Turán conjecture: A subset S of the natural numbers that contains<br />

a positive proportion of the natural numbers (that is, the limsup of the<br />

proportion of S ∩ [1,x]in{1, 2,...,⌊x⌋} is positive) must contain arbitrarily<br />

long arithmetic progressions. This result appears not to apply, since the primes<br />

do not form a positive proportion of the natural numbers. However, Green<br />

and Tao actually prove a version of Szemerédi’s theorem where the universe<br />

of natural numbers is allowed to be somewhat generalized. They then proceed<br />

to give an appropriate superset of the primes for which the Szemerédi analogue<br />

is valid and for which the primes form a positive proportion. Altogether, the<br />

Green–Tao development is quite amazing.<br />

1.2 Celebrated conjectures and curiosities<br />

We have indicated that the definition of the primes is so very simple, yet<br />

questions concerning primes can be so very hard. In this section we exhibit<br />

various celebrated problems of history. The more one studies these questions,<br />

the more one appreciates the profundity of the games that primes play.<br />

1.2.1 Twin primes<br />

Consider the case of twin primes, meaning two primes that differ by 2. It is<br />

easy to find such pairs, take 11, 13 or 197, 199, for example. It is not so easy,<br />

but still possible, to find relatively large pairs, modern largest findings being<br />

the pair<br />

835335 · 2 39014 ± 1,<br />

found in 1998 by R. Ballinger and Y. Gallot, the pair<br />

361700055 · 2 39020 ± 1,<br />

found in 1999 by H. Lifchitz, and (see [Caldwell 1999]) the twin-prime pairs<br />

discovered in 2000:<br />

2409110779845 · 2 60000 ± 1,<br />

byH.Wassing,A.Járai, and K.-H. Indlekofer, and<br />

665551035 · 2 80025 ± 1,<br />

by P. Carmody. The current record is the pair<br />

154798125 · 2 169690 ± 1,<br />

reported in 2004 by D. Papp.<br />

Are there infinitely many pairs of twin primes? Can we predict,<br />

asymptotically, how many such pairs there are up to a given bound? Let<br />

us try to think heuristically, like the young Gauss might have. He had guessed<br />

that the probability that a random number near x is prime is about 1/ ln x,<br />

and thus came up with the conjecture that π(x) ≈ x<br />

dt/ ln t (see Section<br />

2<br />

1.1.5). What if we choose two numbers near x. If they are “independent prime

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

Saved successfully!

Ooh no, something went wrong!