# A lower bound for the least prime in an arithmetic progression

@article{Li2016ALB,
title={A lower bound for the least prime in an arithmetic progression},
author={Junxian Li and Kyle Pratt and George Shakan},
journal={arXiv: Number Theory},
year={2016}
}
• Published 8 July 2016
• Mathematics
• arXiv: Number Theory
Fix $k$ a positive integer, and let $\ell$ be coprime to $k$. Let $p(k,\ell)$ denote the smallest prime equivalent to $\ell \pmod{k}$, 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) \gg \phi(k) \log k \log_2 k \log_4 k / \log_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… Expand
14 Citations
On the nth record gap between primes in an arithmetic progression
Let $q>r\ge1$ be coprime integers. Let $R(n,q,r)$ be the $n$th record gap between primes in the arithmetic progression $r$, $r+q$, $r+2q,\ldots,$ and denote by $N_{q,r}(x)$ the number of such recordsExpand
Long gaps between primes
• Mathematics
• 2014
Let $p_n$ denotes the $n$-th prime. We prove that $$\max_{p_{n+1} \leq X} (p_{n+1}-p_n) \gg \frac{\log X \log \log X\log\log\log\log X}{\log \log \log X}$$ for sufficiently large $X$, improving uponExpand
Predicting Maximal Gaps in Sets of Primes
• Mathematics
• Mathematics
• 2019
Let q > r ≥ 1 be coprime integers. Let P c = P c ( q , r , H ) be an increasing sequence of primes p satisfying two conditions: (i) p ≡ r (mod q) and (ii) p starts a prime k-tuple with a givenExpand
Dirichlet's proof of the three-square theorem: An algorithmic perspective
• Computer Science
• Math. Comput.
• 2019
It is explained how to turn Dirichlet’s proof of the Gauss–Legendre three-square theorem into an algorithm; if one assumes the Extended Riemann Hypothesis (ERH), there is a random algorithm for expressing n = x + y + z where the expected number of bit operations is O((lgn)(lg lgn)−1 ·M(lgn). Expand
Polynomial multiplication over finite fields in time O ( n log n )
• 2019
Let I(n) denote the bit complexity of multiplying two integers of at most n bits in the deterministic multitape Turing model . Similarly, letMq(n) denote the bit complexity of multiplying twoExpand
N T ] 8 O ct 2 02 0 SCHINZEL HYPOTHESIS ON AVERAGE AND RATIONAL POINTS
Schinzel’s Hypothesis (H)  has very strong implications for the local-to-global principles for rational points on conic bundles, as demonstrated by Colliot-Thélène and Sansuc in . There haveExpand
Schinzel Hypothesis with probability 1 and rational points
• Mathematics
• 2020
We prove the existence version of Schinzel's Hypothesis (H) for $100\%$ of integer polynomials $P_1, \ldots, P_n$ of fixed degrees, when ordered by the size of coefficients. We deduce that a positiveExpand
Bernoulli models of Euler factors 6 3 . Möbius randomness law 9 4 . Dispersion 16 5
Schinzel’s Hypothesis (H)  has very strong implications for the local-to-global principles for rational points on conic bundles, as demonstrated by Colliot-Thélène and Sansuc in . There haveExpand
Large prime gaps and progressions with few primes
We show that the existence of arithmetic progressions with few primes, with a quantitative bound on "few", implies the existence of larger gaps between primes less than x than is currently knownExpand
Faster integer multiplication using plain vanilla FFT primes
• Mathematics, Computer Science
• Math. Comput.
• 2019
It is shown that n-bit integers may be multiplied in O(n log n 4^(log^* n)) bit operations. Expand