Gaussian Asymptotic Properties of the Sum-of-Digits Function Original Research Article

We will show that the sum-of-digits function has an asymptotic Gaussian behaviour, and we deduce some new summational formulae. More precisely we consider numeration systems relative to substitutive bases, whose general case contains among others the case of Parry linear recurrent bases (as the Fibonacci sequence for instance).