A lower bound for the least prime in an arithmetic progression
From MaRDI portal
Publication:4602829
Abstract: Fix a positive integer, and let be coprime to . Let denote the smallest prime equivalent to , and set to be the maximum of all the . We seek lower bounds for . In particular, we show that for almost every one has 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
Recommendations
Cited in
(15)- Dirichlet’s proof of the three-square theorem: An algorithmic perspective
- 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
- scientific article; zbMATH DE number 4110798 (Why is no real title available?)
- Faster integer multiplication using plain vanilla FFT primes
- Polynomial multiplication over finite fields in time \(O(n\log n)\)
- The twin prime conjecture
- On the gaps between consecutive primes
- scientific article; zbMATH DE number 897188 (Why is no real title available?)
- 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)