Increasing and decreasing prime gaps

Abstract: Let

p_{n}

denote the

n

th prime and

g_{n} := p_{n + 1} - p_{n}

the

n

th prime gap. We demonstrate the existence of infinitely many values of

n

for which

g_{n} > g_{n + 1} > c d o t s > g_{n + m}

with

m g g l o g l o g l o g n

and similarly for the reversed inequalities. In doing so we settle a conjecture of Erd"os for the case

m = 2

.

This page was built for publication: Increasing and decreasing prime gaps