Journal Article10.4007/ANNALS.2014.179.3.7
Bounded gaps between primes
Abstract: It is proved that
lim inf n?8 (p n+1 -p n )<7×10 7 , where p n is the n -th prime.
Our method is a refinement of the recent work of Goldston, Pintz and Yildirim on the small gaps between consecutive primes. A major ingredient of the proof is a stronger version of the Bombieri-Vinogradov theorem that is applicable when the moduli are free from large prime divisors only, but it is adequate for our purpose
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Small gaps between primes
TL;DR: In this paper, the GPY sieve method for studying prime k-tuples and small gaps between primes was introduced and it was shown that for each k, the prime k -tuples conjecture holds for a positive proportion of admissible k-toples.
Variants of the Selberg sieve, and bounded intervals containing many primes
TL;DR: In particular, this paper showed that for any admissible triple (h1,h2,h3), there are infinitely many n for which at least two of n+h 1,n+h 2,h 3 are prime, and also showed that either the twin prime conjecture holds or the even Goldbach conjecture is asymptotically true if one allows an additive error of at most 2, or both.
Ramanujan Sums in the Context of Signal Processing—Part I: Fundamentals
TL;DR: In the companion paper (Part II), it is shown that arbitrary finite duration signals can be decomposed into a finite sum of orthogonal projections onto Ramanujan subspaces.
153
New equidistribution estimates of Zhang type
Wouter Castryck,Étienne Fouvry,Gergely Harcos,Emmanuel Kowalski,Philippe Michel,Paul D. Nelson,E. Paldi,János Pintz,Andrew V. Sutherland,Terence Tao,Xiao-Feng Xie +10 more
TL;DR: For arithmetic progressions to large smooth squarefree moduli, with respect to congruence classes obeying Chinese remainder theorem conditions, the authors obtained an exponent of distribution 1/2 + 7/300.
•Posted Content
Dense clusters of primes in subsets
TL;DR: In this article, it was shown that any subset of the primes which is well-distributed in arithmetic progressions contains many primes that are close together, and lower bounds of the correct order of magnitude for the number of strings of $m$ congruent primes with $p n+m-p_n\le \epsilon\log{x}$.
77
References
La conjecture de Weil I.
TL;DR: In this article, the authors implique l'accord avec les conditions generales d'utilisation (http://www.numdam.org/legal.php).
Numbers of solutions of equations in finite fields
TL;DR: In this paper, it was shown that for a prime of the form p = 4n + 1, the number of solutions of any congruence ax − by ≡ 1 (mod p) for a given biquadratic character of 2 mod p can be computed using Gaussian sums of order 3.
Primes in arithmetic progressions to large moduli
TL;DR: In this article, the authors present a set of notations for the use of the word "cascade" in the form of a sequence of n-grams, where each node corresponds to a node in a tree.
A Brun-Titschmarsh theorem for multiplicative functions.
TL;DR: In this paper, the problem of estimating the number of positive integers not exceeding χ having no prime factor greater than y is reduced to estimating the Φ(χ,γ) of positive integer not exceeding Φ having no constant in a and k, provided that k
316
Primes in tuples I
TL;DR: In this article, it was shown that there are infinitely often primes differing by 16 or less in the Elliott-Halberstam conjecture and that there exist consecutive primes which are closer than any arbitrarily small multiple of the average spacing.
282