We gratefully acknowledge support from
the Simons Foundation and member institutions.
Full-text links:

Download:

Current browse context:

math.NT
< prev | next >
new | recent | 2404

Change to browse by:

math
math.CA

References & Citations

Bookmark

(what is this?)
CiteULike logo BibSonomy logo Mendeley logo del.icio.us logo Digg logo Reddit logo

Mathematics > Number Theory

Title: Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression

Authors: Emanuel Carneiro, Micah B. Milinovich, Emily Quesada-Herrera, Antonio Pedro Ramos
(Submitted on 12 Apr 2024)
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.
Comments: 25 pages, 4 figures
Subjects: Number Theory (math.NT); Classical Analysis and ODEs (math.CA)
MSC classes: 11M06, 11M26, 11N13, 42A38, 65K05
Cite as: arXiv:2404.08380 [math.NT]
  (or arXiv:2404.08380v1 [math.NT] for this version)

Submission history

From: Emanuel Carneiro [view email]
[v1] Fri, 12 Apr 2024 10:31:19 GMT (56kb)
Which authors of this paper are endorsers? | Disable MathJax (What is MathJax?)

Link back to: arXiv, form interface, contact.