A note on small gaps between primes in arithmetic progressions (Q2804247)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: A note on small gaps between primes in arithmetic progressions |
scientific article; zbMATH DE number 6574967
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | A note on small gaps between primes in arithmetic progressions |
scientific article; zbMATH DE number 6574967 |
Statements
A note on small gaps between primes in arithmetic progressions (English)
0 references
28 April 2016
0 references
distribution of primes
0 references
primes in progressions
0 references
0.9565783
0 references
0.95196104
0 references
0.9252051
0 references
0.9217324
0 references
0.9188513
0 references
Recently, by modifying the method of Goldston-Pintz-Yıldırım, \textit{J. Maynard} [Ann. Math. (2) 181, No. 1, 383--413 (2015; Zbl 1306.11073)] and Tao (independently) gave a method to detect \(m\) primes in admissible \(k\)-tuples for any \(m\), if \(k\) is large enough. In the present paper, the author modifies the method to get alike results concerning primes in an arithmetic progression. Then several results are obtained concerning gaps between consecutive primes in arithmetic progressions. The key ingredient in the proofs is a Bombieri-Vinogradov-type theorem.
0 references
