We give various bounds for character sums in various ranges. The main idea is that if a character sum up to
x is large, for a character of modulus
q, then it is large on
y-smooth numbers, where
y is of order
logq+(logx)2, and this is the main contribution to the original character sum. We prove a weak such result assuming the Generalized Riemann Hypothesis, and unconditionally show that there are characters such that their sum up to
(logq)A is
≫A(logq)A.
Article