Answers are grounded in this paper and cite their sources.
For any given integer we prove the existence of infinitely many and characters of order such that . We believe this bound to be the best possible. When the order is even, we obtain similar results for and , where is restricted to even (or odd) characters of order and is a fixed quadratic character. As an application of these results, we exhibit large even-order character sums, which are likely to be optimal.
No takes yet. Share an insight, caveat, or question.
Youness Lamzouri (2016) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: