A remark on the least n with χ (n) ≠ 1

摘要

Suppose that a > 2. We prove that the number of positive integers q ≦ Q such that there exists a primitive character χ modulo q with χ (n) = 1 for all n ≦ (log Q) a is O(Q 1/(1-a)+ε).