Abstract
After the proof of Zhang about the existence of infinitely many bounded gaps between consecutive primes the author showed the existence of a bounded d such that there are arbitrarily long arithmetic progressions of primes with the property that p ′ = p + d is the prime following p for each element of the progression. This was a common generalization of the results of Zhang and Green-Tao. In the present work it is shown that for every m we have a bounded m-tuple of primes such that this configuration (i.e. the integer translates of this m-tuple) appear as arbitrarily long arithmetic progressions in the sequence of all primes. In fact we show that this is true for a positive proportion of all m-tuples. This is a common generalization of the celebrated works of Green-Tao and Maynard/Tao.
Dedicated to the 60th birthday of Robert F. Tichy
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
L.E. Dickson, A new extension of Dirichlet’s theorem on prime numbers. Messenger Math. (2) 33, 155–161 (1904)
D.A. Goldston, J. Pintz, C.Y. Yıldırım, Primes in tuples I. Ann. Math. 170, 819–862 (2009)
D.A. Goldston, S.W. Graham, J. Pintz, C.Y. Yıldırım, Small gaps between products of two primes. Proc. Lond. Math. Soc. (3) 98(3), 741–774 (2009)
G. Greaves, Sieves in Number Theory (Springer, Berlin, 2001)
B. Green, T. Tao, The primes contain arbitrarily long arithmetic progressions. Ann. Math. (2) 167(2), 481–547 (2008)
H. Halberstam, H.-E. Richert, Sieve Methods (Academic Press, New York, 1974)
G.H. Hardy, J.E. Littlewood, Some Problems of ‘Partitio Numerorum’. III. On the expression of a number as a sum of primes. Acta Math. 44, 1–70 (1923)
J. Maynard, Small gaps between primes, Ann. Math. (2) 181(1), 383–413 (2015)
H. Parshall, Small gaps between configurations of prime polynomials. J. Number Theory 162, 35–53 (2016)
J. Pintz, Are there arbitrarily long arithmetic progressions of twin primes? in An irregular mind. Szemerédi is 70. Bolyai Society Mathematical Studies, vol. 21 (Springer, New York, 2010)
J. Pintz, Polignac numbers, conjectures of Erdős on gaps between primes, arithmetic progressions in primes, and the bounded gap conjecture, in From Arithmetic to Zeta-Functions, Number Theory in Memory of Wolfgang Schwarz, ed. by J. Sander, J. Steuding, R. Steuding (Springer, 2016), pp. 367–384
A. Selberg, Collected Papers, vol. II (Springer, Berlin, 1991)
Y. Zhang, Bounded gaps between primes. Ann. Math. (2) 179(2), 1121–1174 (2014)
Acknowledgements
The author thanks to the referee for his valuable suggestions. The author was supported by National Research, Development and Innovation Office, NKFIH, OTKA NK 104181, K100291 and ERC-AdG. 321104.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this chapter
Cite this chapter
Pintz, J. (2017). Patterns of Primes in Arithmetic Progressions. In: Elsholtz, C., Grabner, P. (eds) Number Theory – Diophantine Problems, Uniform Distribution and Applications. Springer, Cham. https://doi.org/10.1007/978-3-319-55357-3_19
Download citation
DOI: https://doi.org/10.1007/978-3-319-55357-3_19
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-55356-6
Online ISBN: 978-3-319-55357-3
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)