Lower Bounds on Odd Order Character Sums†
Lower Bounds on Odd Order Character Sums†
A classical result of Paley shows that there are infinitely many quadratic characters χ(mod q) whose character sums get as large as ; this implies that a conditional upper bound of Montgomery and Vaughan cannot be improved. In this paper, we derive analogous lower bounds on character sums for characters …