A note on small gaps between primes in arithmetic progressions
Abstract
We implement the Maynard-Tao method of detecting primes in tuples to investigate small gaps between primes in arithmetic progressions, with bounds that are uniform over a range of moduli.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.