Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression
arXiv:2404.08380
Abstract
By means of a Fourier optimization framework, we improve the current asymptotic bounds under GRH for two classical problems in number theory: the problem of estimating the least quadratic non-residue modulo a prime, and the problem of estimating the least prime in an arithmetic progression.
33 pages, 3 figures. v2 includes an enhanced numerical discussion in Section 6, and an Appendix