arXiv · 1005.4703
Strings of congruent primes in short intervals
Abstract
Fix \epsilon > 0, and let p_1 = 2, p_2 = 3,... be the sequence of all primes. We prove that if (q,a) = 1 then there are infinitely many pairs p_r, p_{r+1} such that p_r \equiv p_{r+1} \equiv a \mod q and p_{r+1} - p_r < \epsilon\log p_r. The proof combines the ideas of Shiu and Goldston-Pintz-Yildirim.
Explore related subjects
Keep this discovery
Tristan Freiberg. 2010-05-25. Strings of congruent primes in short intervals. https://doi.org/10.1112/jlms%2Fjdr006
Cite the original work for its findings. Save a collection to share your selection of sources.