A lower bound for the least prime in an arithmetic progression

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

Kyle Pratt, Junxian Li, George Shakan

Publication date: 7 February 2018

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

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.$

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

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

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)

Cited In (15)

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

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)