Remote Access Proceedings of the American Mathematical Society
Green Open Access

Proceedings of the American Mathematical Society

ISSN 1088-6826(online) ISSN 0002-9939(print)



Quadratic non-residues in short intervals

Authors: Sergei V. Konyagin and Igor E. Shparlinski
Journal: Proc. Amer. Math. Soc. 143 (2015), 4261-4269
MSC (2010): Primary 11A15, 11L40
Published electronically: March 31, 2015
MathSciNet review: 3373925
Full-text PDF

Abstract | References | Similar Articles | Additional Information

Abstract: 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+\psi (Q)]$ does not contain a quadratic non-residue modulo $ p$. The bound is non-trivial for any function $ \psi (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$.

References [Enhancements On Off] (What's this?)

Similar Articles

Retrieve articles in Proceedings of the American Mathematical Society with MSC (2010): 11A15, 11L40

Retrieve articles in all journals with MSC (2010): 11A15, 11L40

Additional Information

Sergei V. Konyagin
Affiliation: Steklov Mathematical Institute, 8, Gubkin Street, Moscow, 119991, Russia

Igor E. Shparlinski
Affiliation: Department of Pure Mathematics, University of New South Wales, Sydney, NSW 2052, Australia

Keywords: Quadratic non-residues, character sums
Received by editor(s): November 27, 2013
Received by editor(s) in revised form: June 21, 2014
Published electronically: March 31, 2015
Communicated by: Matthew A. Papanikolas
Article copyright: © Copyright 2015 American Mathematical Society

American Mathematical Society