.png){kind=icon}
Return
Large gaps between primes
.png){kind=icon}
OA
AI
DOI：10.4007/annals.2016.183.3.3.png)
.png){kind=icon}
Original request for help.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
We show that there exist pairs of consecutive primes less than x whose difference is larger than t(1 + o(1))(logx)(log log x) (log log log log x) (log log log x)(-2) for any fixed t. This answers a well-known question of Erdos.
Journal
IF:
5.3
Papers:
1.4K
Citations:
1.6W
Organization
Cited Papers
.png){kind=icon}
ShareSaveShareSaveShareSave
ShareSaveShareSave
View more