# Gerald Tenenbaum: Sums of digits of polynomial values

## This is a joint work with Cécile Dartyge.

This is an account on two joint works with Cécile Dartyge (Nancy 1).

Let with and . For , we denote by the sum of digits of in the -ary digital expansion. Let be a quadratic polynomial with integer coefficients. We show that there exists such that for all , ,

In the special case and , the value is admissible.

While a fairly simple proof of (1) may be provided when , the general case requires rather sophisticated tools. The approach followed in the above-mentioned works is based on an upper bound for the quantity

when , , , , with the usual notation .

Other applications of this general device will be described, in particular the following two, where congruence properties of sums of digits may be combined with multiplicative constraints.

(i) Given positive integers with , , , there exist infinitely many integers having exactly prime factors and such that . This improves on a result of Étienne Fouvry and Christian Mauduit by removing an indetermination arising from the so-called parity phenomenon.

(ii) Daboussi-type theorem for sums of digits.

Let , , and . Uniformly for

and multiplicative complex arithmetic function with values in the unit disc, we have

This is stated in dimension 2 for simplicity, but the result may be extended to any finite dimension.
Please send comments and corrections to Thomas Klausner.