Fourier 优化、最小二次非剩余与算术级数中的最小素数
数论
2025-08-13 v2 经典分析与常微分方程
摘要
借助 Fourier 优化框架，我们改进了在广义黎曼假设 (GRH) 下数论中两个经典问题的渐近界：估计模素数的最小二次非剩余问题，以及估计算术级数中最小素数的问题。
引用
@article{arxiv.2404.08380,
title = {Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression},
author = {Emanuel Carneiro and Micah B. Milinovich and Emily Quesada-Herrera and Antonio Pedro Ramos},
journal= {arXiv preprint arXiv:2404.08380},
year = {2025}
}
备注
33 pages, 3 figures. v2 includes an enhanced numerical discussion in Section 6, and an Appendix