arrow
Return

Large gaps between consecutive prime numbers

delete2016-05-01
delete25
delete
OA
AI
K
Kevin Ford *
B
Ben Green *
S
Sergeĭ Konyagin *
T
Terence Tao *
DOI:10.4007/annals.2016.183.3.4delete
deleteOriginal
deleteOriginal request for help
deleteShare
deleteSave
Abstract

Abstract

En 中文
Let G(X) denote the size of the largest gap between consecutive primes below X. Answering a question of Erdos, we show that G(X) >= f(X) log X log log X log log log log X/(log log log X)(2) where f(X) is a function tending to infinity with X. Our proof combines existing arguments with a random construction covering a set of primes by arithmetic progressions. As such, we rely on recent work on the existence and distribution of long arithmetic progressions consisting entirely of primes.
Keywords:
INVERSE THEOREM

Journal

Annals of Mathematics cover
Annals of Mathematics
IF:
5.3
Papers:
1.4K
Citations:
1.6W

Organization

U
University of Illinois Urbana-Champaign
Scholars:
2.4W
Papers: 2.0W
Citations: 35
R
russian academy of sciences
Scholars:
9.1W
Papers: 6.0W
Citations: 60
University of Illinois System cover
University of Illinois System
Scholars:
6.8W
Papers: 6.2W
Citations: 644
U
university of oxford
Scholars:
9.7W
Papers: 8.6W
Citations: 137
researcher View more organizations