Chen primes in arithmetic progressions
Abstract
We find a lower bound for the number of Chen primes in the arithmetic progression a q, where (a,q)=(a+2,q)=1. Our estimate is uniform for q ≤ M x, where M>0 is fixed.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.