2000 character limit reached
Strings of special primes in arithmetic progressions (1407.1290v1)
Published 4 Jul 2014 in math.NT
Abstract: The Green-Tao Theorem, one of the most celebrated theorems in modern number theory, states that there exist arbitrarily long arithmetic progressions of prime numbers. In a related but different direction, a recent theorem of Shiu proves that there exist arbitrarily long strings of consecutive primes that lie in any arithmetic progression that contains infinitely many primes. Using the techniques of Shiu and Maier, this paper generalizes Shiu's Theorem to certain subsets of the primes such as primes of the form $\lfloor \pi n\rfloor$ and some of arithmetic density zero such as primes of the form $\lfloor n\log\log n\rfloor$.