UPDF AI

A conditional bound for the least prime in an arithmetic progression

Mat'ias Bruna

2026 · ArXiv: 2603.25612
0 Citations

Abstract

Assuming the generalized Lindel"of hypothesis for Dirichlet LL-functions, we establish that the least prime p≡a(modq)p\equiv a\pmod{q} satisfies p≪εq2+εp\ll_{\varepsilon} q^{2+\varepsilon}. This achieves a bound that nearly matches the classical estimate implied by the generalized Riemann hypothesis.