UPDF AI

Conditional bounds for the least quadratic non-residue and related problems

Youness Lamzouri,Xiannan Li,K. Soundararajan

2013 · DOI: 10.1090/S0025-5718-2015-02925-1
Mathematics of Computation · 94 Citations

TLDR

The existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression are improved and the classical conditional bounds of Littlewood for L-functions at s=1 are refined.

Abstract

This paper studies explicit and theoretical bounds for several interesting quantities in number theory, conditionally on the Generalized Riemann Hypothesis. Specifically, we improve the existing explicit bounds for the least quadratic non-residue and the least prime in an arithmetic progression. We also refine the classical conditional bounds of Littlewood for LL-functions at s=1s=1. In particular, we derive explicit upper and lower bounds for L(1,χ)L(1,\chi) and ζ(1+it)\zeta(1+it), and deduce explicit bounds for the class number of imaginary quadratic fields. Finally, we improve the best known theoretical bounds for the least quadratic non-residue, and more generally, the least kk-th power non-residue.