Numbers with fixed sum of digits in linear recurrent number systems (Q2642506): Difference between revisions

The author considers digital expansions with respect to a linear recurrent number system \(G\), generalizing results of \textit{C. Mauduit} and \textit{A. Sárközy} [Acta Arith. 81, No. 2, 145--173 (1997; Zbl 0887.11008)] for \(g\)-ary number systems. For given number of digits \(\nu\), the author gives an asymptotic formula for the number of integers with at most \(\nu\) digits with given sum of digits \(k\). Furthermore, it is shown that numbers with fixed sum of digits are uniformly distributed in residue classes modulo some \(m\) under some very general conditions, namely that there is no prime factor \(p\) of \(m\) such that all but finitely many elements of \(G\) leave the same residue modulo \(p\). The proof uses estimates for exponential sums using known results from Diophantine approximation.