Prescribing digits in finite fields.

Let p be a prime number, q = p r with r ≥ 2 and P ∈ F q [ X ] . In this paper, we first estimate the number of x ∈ F q such that P ( x ) has prescribed digits (in the sense of Dartyge and Sárközy). In particular, for a given proportion <0.5 of prescribed digits, we show that this number is asymptotically as expected. Then, we obtain similar results when x is allowed to run only in the set of generators (primitive elements) of F q ⁎ . In the case of special interest where P is a monomial of degree 2, our estimate for the number of x ∈ F q such that P ( x ) has prescribed digits is sharper than the estimate following from the Weil bound. We will need to study exponential sums of independent interest such as multiplicative character sums over affine subspaces and additive character sums with generator arguments. [ABSTRACT FROM AUTHOR]