1940 10erdos

Reprinted from DUKE MATHEMATICAL JOURNAL .
Vol . 6, No . 2, June, 1940
THE DIFFERENCE OF CONSECUTIVE PRIMES

BY P. ERDÖS
Let pn denote the n-th prime. Backlund [1]' proved that, for every positive
e and infinitely many n, pn+i - pn > (2 - e) log p . . Brauer and Zeitz [2, 10]
proved that 2 - e can be replaced by 4 - e. Westzynthius [9] proved that for
an infinity of n
n+l - > 2 logpnlog log log p n
P n+1 pn
log log log pn '
and this was improved by Ricci [7] to
p„ > cl log pn log log log pn ,
pn+i -
where, as throughout the paper, the c's denote positive absolute constants. I
[4] showed that
109pnlog 109Pn
Pn+1 - pn > C2
(log log log p n)$
and lately Rankin [6] proved
109pnlog log p n log log log logpn
pn+1 - pn > C8
(log log log p n) 2
In the other direction the best known result is that of Ingham [5] which
states that for sufficiently large n
pn+i - Ps < p? < pn
Thus it is known that
lim sup pn+l - Ps = oo .

n-oo log pn
Very much less is known about
- pn .
A = lim inf pn+'
log pn
Hardy and Littlewood proved a few years ago, by using the Riemann hypothesis,
that A S -'s, and Rankin recently proved, again by using the Riemann hypothe-
sis, that A 5 1. In the present paper we are going to prove-without the
Riemann hypothesis-that
A < 1 - c4, for a certain c` > 0 .
Received December 12, -1939.
1 Numbers in brackets refer to the bibliography at the end of the paper .
438
THE DIFFERENCE OF CONSECUTIVE PRIMES 439
It seems extremely likely that A = 0 . In fact, a well-known conjecture

states that the equation p„+1 - pn = 2 has infinitely many solutions (i .e., there
are infinitely many prime twins) .
We need two lemmas .
LEMMA 1. The number of solutions of
a= pips, pi ,pi :-!g n,

does not exceed
~ 1 + 1`, n
p/ (logn) 2 .
C6
Pia
The proof is well known ([8], p . 670) .

LEMMA 2. Let C4 be sufficiently small ; then
~' Pla ( 1 + p/ < 6c6 log n,

where the prime indicates that the summation is extended over the a's of the interval
(1 - c4) log n 5 a <_ (1 + c4) log n .
Proof. We have
E 1(2c4 log n
E' II 1 + 1) < + 1
gn la ( p d<(1+c4) log n d d
< c6 log n + E 1
d
< 1 log n
64
d<(1+c4) log n
for sufficiently small c 4 and the proof is complete .

Now we can prove our theorem . Denote by p1 , P2, , pz the primes of
the interval ;n, n. It follows from the prime number theorem that, for suffi-
iently large n, x > (I - e)n/log n . It suffices to prove that if n is sufficiently
large, then for at least one i
p :+1 - p : < (1 - c4) log n (i < x - 1) .
For then we have
pr+1-pr < (1 -c4)log n
lim inf c4 .
log pr log in
Write
b1=p2-p1,b2=Pa-p2, . . .) b_1= p s -p4-1 .
Evidently
X-1
~b;<=an.
ial
440 P . ERDÖS
From Lemmas 1 and . 2 it follows that the number of b's lying in the interval
(1 - cs) log n S b S_ (1 + c4) log n
does not exceed
CS
(log n) 2 ~' pla C1 + p) < 6 log n
Hence if bi < (1 - C) log n had no solution, we should obtain
a-1
n n
bi > (1 - c4) log n + ( - E) (1 + c4) log n
s-I 6109, n log n
= in(1 - 2e) + (} - e)cen > in.
This is an evident contradiction and the theorem is proved .
Denote by qI < qs < . . . < q„ the primes not exceeding n. Cramér [3]
proved by aid of the Riemann hypothesis that
I
n
qi) (qi+I - qi > (log qi) 8) .
= 0 log log n
It might be conjectured that the following stronger result also holds :
(qi+I - qi)$ = 0(n log n) .

i-I
This result if true must be very deep . I could not even prove the following
very much more elementary conjecture : Let n be any integer and let 0 < a I
< a2 < . . . < a z < n be the re(n) integers relatively prime to n ; then
Ei-I(a(+, - ai)z < ce

,p(n)
BIBLIOGRAPHY
1 . R . J . BACKLUND, Über die Differenzen zwischen den Zahlen die zu den n ersten Primzahlen
teilerfremd rind, commemoration volume in honor of E . L . Lindelöf, Helsingfore,
1929 .
2 . A . BRAUER AND H . ZEITZ, Über eine zahlentheoretische Behauptung von Legendre, Sitz .
Berliner Math. Gee ., vol . 29(1930), pp . 116-125 .
3 . H . CRAMÉR, On the difference between consecutive primes, Acta Arithmetica, vol . 2(1937),
pp . 23-45.
4 . P . ERDÖS, On the difference of consecutive primes, Quarterly Journal of Math., Oxford
Series, vol . 6(1935), pp. 124-128 .
5 . A. E . INGHAM, On the difference between consecutive primes, Quarterly Journal of Math .,
Oxford Series, vol . 8(1937), pp . 255-266 .
6 . R . A . RANKIN, The difference between consecutive primes, Journal London Math . Soc .,
vol . 13(1938), pp. 242-247 .
THE DIFFERENCE OF CONSECUTIVE PRIMES 441
7 . G . RICCI, Ricerche aritmetiche sui polinomi, II : Intorno a una proposizione non vera di
Legendre, Rend . Circ . Mat . di Palermo, vol . 58(1934) .
8 . L . SCHNIRELMANN, Über additive Eigenschaften von Zahlen, Math . Annalen, vol .
107(1933), pp . 649-690.
9 . E. WESTZYNTHIUS, Über die Verteilung der Zahlen die zu den n ersten Primzahlen teiler-
fremd sired, Comm . Phys . Math. Soc . Sci . Fenn., Helsingfors, vol . 5(1931), no.
25, pp . 1-37 .
10 . H. ZEITZ, Elementare Betrachtung fiber eine zahlentheoretische Behauptung von Legendre,
Berlin, 1930 .
INSTITUTE FOR ADVANCED STUDY .

1940 10erdos

Uploaded by

Copyright:

Available Formats

1940 10erdos

Uploaded by

Document Information

Original Description:

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

1940 10erdos

Uploaded by

Copyright:

Available Formats

Reprinted from DUKE MATHEMATICAL JOURNAL .

Vol . 6, No . 2, June, 1940

THE DIFFERENCE OF CONSECUTIVE PRIMES

lim sup pn+l - Ps = oo .

It seems extremely likely that A = 0 . In fact, a well-known conjecture

a= pips, pi ,pi :-!g n,

The proof is well known ([8], p . 670) .

~' Pla ( 1 + p/ < 6c6 log n,

for sufficiently small c 4 and the proof is complete .

does not exceed

(qi+I - qi)$ = 0(n log n) .

Ei-I(a(+, - ai)z < ce

INSTITUTE FOR ADVANCED STUDY .

You might also like

Pfad - The Proxy pFad of © 2024 Garber Painting. All rights reserved.