2000 character limit reached
Strings of congruent primes in short intervals
Published 25 May 2010 in math.NT | (1005.4703v2)
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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.