A note on the parity of the sum-of-digits function.
For almost all infinite binary sequences of Bernoulli trials the frequency of blocks of length in the first terms tends asymptotically to the probability of the blocks, if increases like (for ) where tends to . This generalizes a result due to P. Flajolet, P. Kirschenhofer and R.F. Tichy concerning the case .
We characterize statistical independence of sequences by the -discrepancy and the Wiener -discrepancy. Furthermore, we find asymptotic information on the distribution of the -discrepancy of sequences.
Page 1