A RetroSearch Logo

Home - News ( United States | United Kingdom | Italy | Germany ) - Football scores

Search Query:

Showing content from https://doi.org/10.1090/jams/876 below:

Website Navigation


Journal of the American Mathematical Society

Journals Home eContent Search About Journal of the American Mathematical Society Editorial Board Author and Submission Information Journal Policies Subscription Information Journal Email Notifications Remote Access Long gaps between primes
HTML articles powered by AMS MathViewer
by Kevin Ford, Ben Green, Sergei Konyagin, James Maynard and Terence Tao;
J. Amer. Math. Soc. 31 (2018), 65-105
DOI: https://doi.org/10.1090/jams/876
Published electronically: February 23, 2017
HTML | PDF | Request permission
Abstract: Let $p_n$ denote the $n$th prime. We prove that \[ \max _{p_{n} \leqslant X} (p_{n+1}-p_n) \gg \frac {\log X \log \log X\log \log \log \log X}{\log \log \log X}\] for sufficiently large $X$, improving upon recent bounds of the first, second, third, and fifth authors and of the fourth author. Our main new ingredient is a generalization of a hypergraph covering theorem of Pippenger and Spencer, proven using the Rödl nibble method. References Similar Articles Bibliographic Information

RetroSearch is an open source project built by @garambo | Open a GitHub Issue

Search and Browse the WWW like it's 1997 | Search results from DuckDuckGo

HTML: 3.2 | Encoding: UTF-8 | Version: 0.7.4