Strings of congruent primes in short intervals

Details Strings of congruent primes in short intervals Strings of congruent primes in short intervals

2010-05-25

arxiv.org/abs/1005.4703v2

Mathematics

Number Theory

Minor corrections

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Strings of congruent primes in short intervals does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Strings of congruent primes in short intervals, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Strings of congruent primes in short intervals will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-604615