Quadratic Non-residues in Short Intervals

We use the Burgess bound and combinatorial sieve to obtain an upper bound on the number of primes $p$ in a dyadic interval $[Q,2Q]$ for which a given interval $[u+1,u+ψ(Q)]$ does not contain a quadratic non-residue modulo $p$. The bound is nontrivial for any function $ψ(Q)\to\infty$ as $Q\to\infty$. This is an analogue of the well known estimates on the smallest quadratic non-residue modulo $p$ on average over primes $p$, which corresponds to the choice $u=0$.

No reviews yet.

No comments yet.