2000 character limit reached
A note on small gaps between primes in arithmetic progressions (1508.00516v2)
Published 3 Aug 2015 in math.NT
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.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.