Janos Pintz
Published 2013-06-06, updated 2013-07-17Version 4
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.
Comments: This paper became irrelevant due to a quick progress in the Polymath project of Terrence Tao
On the law of the iterated logarithm for trigonometric series with bounded gaps II
Bounded gaps between primes
Bounded gaps between primes in special sequences
![QR code for arXiv:1306.1497 [math.NT]](http://oss.arxitics.com/images/favicon.svg)