Quantcast

Chen primes in arithmetic progressions

Research paper by Paweł Karasek

Indexed on: 31 Jan '16Published on: 31 Jan '16Published in: Mathematics - Number Theory



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 \log^M x$, where $M>0$ is fixed.