In F q , Dartyge and Sárközy introduced the notion of digits and studied some properties of the sum of digits function. We will provide sharp estimates for
the number of elements of special sequences of F q whose sum of digits is prescribed. Such special sequences of particular interest include the set of n-th powers for each n ≥ 1 and the set of elements of order d in F q ∗ for each divisor d of q − 1. We provide an optimal estimate for the number of squares whose sum of digits is prescribed. Our methods combine A. Weil bounds with character sums, Gaussian sums and exponential sums.

EB00000003675K

Available