A note on bounded gaps between primes

Abstract

As a refinement of the celebrated recent work of Yitang Zhang we show that any admissible k-tuple of integers contains at least two primes and almost primes in each component infinitely often if k is at least 181000. This implies that there are infinitely many gaps between consecutive primes of size at most 2530338, with an improved admissible k-tuple of Andrew W. Sutherland to 2326476.

This paper became irrelevant due to a quick progress in the Polymath project of Terrence Tao

Cited by in corpus (2)

• The "bounded gaps between primes" Polymath project - a retrospective
• Variants of the Selberg sieve, and bounded intervals containing many primes