2000 character limit reached
Chen primes in arithmetic progressions (1601.02873v4)
Published 12 Jan 2016 in math.NT
Abstract: We find a lower bound for the number of Chen primes in the arithmetic progression $a \bmod q$, where $(a,q)=(a+2,q)=1$. Our estimate is uniform for $q \leq \logM x$, where $M>0$ is fixed.
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.
