2000 character limit reached
Products of primes in arithmetic progressions: a footnote in parity breaking
Published 18 Oct 2016 in math.NT | (1610.05804v2)
Abstract: We prove that, if $x$ and $q\leqslant x{1/16}$ are two parameters, then for any invertible residue class $a$ modulo $q$ there exists a product of exactly three primes, each one below $x{1/3}$, that is congruent to $a$ modulo $q$.
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.