English

Averages of character sums

Number Theory 2014-09-08 v1

Abstract

We show that a short truncation of the Fourier expansion for a character sum gives a good approximation for the average value of that character sum over an interval. We give a few applications of this result. One is that for any bb there are infinitely many characters for which the sum up to aq/b\approx aq/b is q1/2loglogq\gg q^{1/2} \log \log q for all aa relatively prime to bb; another is that if the least quadratic nonresidue modulo q3(mod4)q \equiv 3 \pmod 4 is large, then the character sum gets as large as (q/π)(L(1,χ)+log2ϵ)(\sqrt{q}/\pi) (L(1, \chi) + \log 2 - \epsilon), and if BB is this nonresidue, then there is a sum of length q/Bq/B which has size (q/π)(log2ϵ)(\sqrt{q}/\pi) (\log 2 - \epsilon).

Keywords

Cite

@article{arxiv.1409.1840,
  title  = {Averages of character sums},
  author = {Jonathan Bober},
  journal= {arXiv preprint arXiv:1409.1840},
  year   = {2014}
}