A conditional bound for the least prime in an arithmetic progression
Number Theory
2026-03-27 v1
Abstract
Assuming the generalized Lindel\"of hypothesis for Dirichlet -functions, we establish that the least prime satisfies . This achieves a bound that nearly matches the classical estimate implied by the generalized Riemann hypothesis.
Cite
@article{arxiv.2603.25612,
title = {A conditional bound for the least prime in an arithmetic progression},
author = {Matías Bruna},
journal= {arXiv preprint arXiv:2603.25612},
year = {2026}
}
Comments
16 pages, comments welcome!