x=N+1 χ(f(x)) ≪ p log p, where A ≪ B denotes |A| < kB for some constant k which in this case depends on the degree of f . The estimate (1) is the best possible. In fact, the first author [8] proved the following: Let q ≥ 3 be an integer, χ a primitive character modulo q, and m and n two positive integers such that χm, χn and χm+n are also primitive characters modulo q. Then for any integers r and s with (r − s, q) = 1, we have the identity