No label defined (Q4240917)

Let \(s_b(n)\) denote the sum of the digits in base \(b\) of the positive integer \(n\); and let \(L_b(n)\) be the number of ``large'' digits (i.e. \([\frac b2]\) or more) in the \(b\) representation of \(n\). Results on \(\sum_{n<x} s_b(n)\), e.g. asymptotic evaluations, have been obtained by L. E. Bush, L. Mirsky, P. Cheo and S. Yien. An explicit expression for \(b=2\) has been discovered by \textit{J. R. Trollope} [Math. Mag. 41, 21-25 (1968; Zbl 0162.06303)]. The authors prove that \[ \sum_{i<n} L_b(i)= c(b)n\log_b n-E_b(n), \] where \(c(b)= [\frac b2]/b\) and \(E_b(n)= O(n)\). In fact, an exact formula for \(E_b(n)\) is deduced. This is, however, too complicated to be stated here.