A lower bound for the least prime in an arithmetic progression

2016/07/08 by Li, Junxian, Pratt, Kyle, Shakan, George
#FOS: Mathematics #Number Theory (math.NT)

paper · doi:10.48550/arxiv.1607.02543

Abstract

Fix k a positive integer, and let ℓ be coprime to k. Let p(k,ℓ) denote the smallest prime equivalent to ℓ \pmodk, and set P(k) to be the maximum of all the p(k,ℓ). We seek lower bounds for P(k). In particular, we show that for almost every k one has P(k) ≫ ϕ(k) log k log₂ k log₄ k / log₃ k, answering a question of Ford, Green, Konyangin, Maynard, and Tao. We rely on their recent work on large gaps between primes. Our main new idea is to use sieve weights to capture not only primes, but also small multiples of primes. We also give a heuristic which suggests that \liminf_k (P(k))/( ϕ(k) log² k) = 1.

Related

• The Least Prime in Arithmetic an Progression
• Sifting for small primes from an arithmetic progression
• Narrow arithmetic progressions in the primes
• The problem of the least prime number in an arithmetic progression and its applications to Goldbach's conjecture
• Primes in arithmetic progressions and short intervals without L-functions