Chen primes in arithmetic progressions

From MaRDI portal



Abstract: We find a lower bound for the number of Chen primes in the arithmetic progression , where (a,q)=(a+2,q)=1. Our estimate is uniform for qleqlogMx, where M>0 is fixed.











This page was built for publication: Chen primes in arithmetic progressions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4634548)