A lower bound for the least prime in an arithmetic progression

DOI10.1093/QMATH/HAX001zbMATH Open1426.11091OpenAlexW2963464756MaRDI QIDQ4602829FDOQ4602829

Authors Junxian Li, Kyle Pratt, George Shakan

Publication date 7 February 2018

Published in The Quarterly Journal of Mathematics (Search for Journal in Brave)

Full work available at URL https://arxiv.org/abs/1607.02543

zbMATH Keywords

arithmetic progressionslarge gapsMaynard-Tao weights

Mathematics Subject Classification ID

Distribution of primes (11N05) Distribution of integers with specified multiplicative constraints (11N25) Primes in congruence classes (11N13)

Abstract: Fix $k$ a positive integer, and let $ell$ be coprime to $k$. Let $p(k,ell)$ denote the smallest prime equivalent to $ellpmodk$, and set $P(k)$ to be the maximum of all the $p(k,ell)$. We seek lower bounds for $P(k)$. In particular, we show that for almost every $k$ one has $P(k)ggphi(k)logklo{g}_{2}klo{g}_{4}k/lo{g}_{3}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 $limin{f}_{k}fracP(k)phi(k)lo{g}^{2}k=1.$

Recommendations

• On primes in arithmetic progressions
• scientific article; zbMATH DE number 897188
• On primes in arithmetic progressions
• The least prime in an arithmetic progression with prime difference.
• A note on the least prime in an arithmetic progression with a prime difference

Cited in

(15)

• Long gaps between primes
• Dirichlet’s proof of the three-square theorem: An algorithmic perspective
• scientific article; zbMATH DE number 897188 (Why is no real title available?)
• scientific article; zbMATH DE number 4110798 (Why is no real title available?)
• Schinzel hypothesis on average and rational points
• Faster integer multiplication using plain vanilla FFT primes
• A bound for the least Gaussian prime \(\omega\) with \(\alpha<\arg(\omega)<\beta\)
• The ternary Goldbach problem with a prime and two isolated primes
• Explicit bounds for products of primes in AP
• The twin prime conjecture
• On the gaps between consecutive primes
• Chains of Large Gaps Between Primes
• Polynomial multiplication over finite fields in time \(O(n\log n)\)
• On the first occurrences of gaps between primes in a residue class
• On primes in arithmetic progressions

This page was built for publication: A lower bound for the least prime in an arithmetic progression

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4602829)