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

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Carneiro, Emanuel, Milinovich, Micah B., Quesada-Herrera, Emily, Ramos, Antonio Pedro
Natura: Preprint
Pubblicazione: 2024
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866913986004385792
author Carneiro, Emanuel
Milinovich, Micah B.
Quesada-Herrera, Emily
Ramos, Antonio Pedro
author_facet Carneiro, Emanuel
Milinovich, Micah B.
Quesada-Herrera, Emily
Ramos, Antonio Pedro
contents 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.
format Preprint
id arxiv_https___arxiv_org_abs_2404_08380
institution arXiv
publishDate 2024
record_format arxiv
spellingShingle Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression
Carneiro, Emanuel
Milinovich, Micah B.
Quesada-Herrera, Emily
Ramos, Antonio Pedro
Number Theory
Classical Analysis and ODEs
11M06, 11M26, 11N13, 42A38, 65K05
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.
title Fourier optimization, the least quadratic non-residue, and the least prime in an arithmetic progression
topic Number Theory
Classical Analysis and ODEs
11M06, 11M26, 11N13, 42A38, 65K05
url https://arxiv.org/abs/2404.08380