A lower bound for the least prime in an Arithmetic progression

DOI10.1093/QMATH/HAX001zbMath1426.11091arXiv1607.02543OpenAlexW2963464756MaRDI QIDQ4602829

Kyle Pratt, Junxian Li, 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

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

Related Items (12)

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

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