2000 character limit reached
A theorem of Bombieri-Vinogradov type with few exceptional moduli (1905.12488v1)
Published 29 May 2019 in math.NT
Abstract: If a set S of pairwise coprime moduli q, less than x9/40, is considered, one obtains the expected behavior for primes up to x in arithmetic progressions mod q, except for a subset of S whose cardinality is bounded by a power of log x.
Sponsor
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.