Strings of congruent primes in short intervals
Number Theory
2014-02-26 v2
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.
Cite
@article{arxiv.1005.4703,
title = {Strings of congruent primes in short intervals},
author = {Tristan Freiberg},
journal= {arXiv preprint arXiv:1005.4703},
year = {2014}
}
Comments
Minor corrections