Papers
Topics
Authors
Recent
2000 character limit reached

Upper Bound of the Least Quadratic Nonresidues

Published 28 May 2021 in math.GM | (2106.00544v8)

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

Summary

Paper to Video (Beta)

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.