arXiv · 2404.08380
Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression
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.
Explore related subjects
Keep this discovery
Emanuel Carneiro, Micah B. Milinovich, Emily Quesada-Herrera, Antonio Pedro Ramos. 2024-04-12. Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression. https://arxiv.org/abs/2404.08380
Cite the original work for its findings. Save a collection to share your selection of sources.