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 there are infinitely many characters for which the sum up to is for all relatively prime to ; another is that if the least quadratic nonresidue modulo is large, then the character sum gets as large as , and if is this nonresidue, then there is a sum of length which has size .
Keywords
Cite
@article{arxiv.1409.1840,
title = {Averages of character sums},
author = {Jonathan Bober},
journal= {arXiv preprint arXiv:1409.1840},
year = {2014}
}