Abstract
It is well-known that cancellation in short character sums (e.g. Burgess’ estimates) yields bounds on the least quadratic nonresidue. Scant progress has been made on short character sums since Burgess’ work, so it is desirable to find another approach to nonresidues. In this note we formulate a new line of attack on the least nonresidue via long character sums, an active area of research. Among other results, we demonstrate that improving the constant in the Polya–Vinogradov inequality would lead to significant progress on nonresidues. Moreover, conditionally on a conjecture on long character sums, we show that the least nonresidue for any odd primitive character (mod k) is bounded by \((\log k)^{1.4}\).
Submitted Version (Free)
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have