English

Upper Bound of the Least Quadratic Nonresidues

General Mathematics 2025-10-10 v9

Abstract

Let p3p\geq3 be a large prime and let n(p)2n(p)\geq2 denotes the least quadratic nonresidue modulo pp. This note sharpens the standard upper bound of the least quadratic nonresidue from the unconditional upper bound n(p)p1/4e+εn(p)\ll p^{1/4\sqrt{e}+\varepsilon} to the conjectured upper bound n(p)(logp)1+εn(p)\ll (\log p)^{1+\varepsilon}, where ε>0\varepsilon>0 is a small number, unconditionally. This improvement breaks the exponential upper bound barrier.

Keywords

Cite

@article{arxiv.2106.00544,
  title  = {Upper Bound of the Least Quadratic Nonresidues},
  author = {N. A. Carella},
  journal= {arXiv preprint arXiv:2106.00544},
  year   = {2025}
}

Comments

Twenty One Pages. Refined Analysis of the Error Term. Keywords: Least quadratic nonresidue; Square root mod $p$; Deterministic algorithm