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.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.