No label defined (Q4936042)

Let \(s_b(i)\) denote the base 10 sum of the digits in the base \(b\) representation of the nonnegative integer \(i\) and \(L_b(i)\) denote the number of large digits \(\lceil{b/2}\rceil\) or more) in the base \(b\) representation of the nonnegative integer \(i\). The authors discuss some sums involving \(s_b(i)\) and \(L_b(i)\). Let \(m\) and \(n\) be nonnegative integers. The first sum which they give formula for is the following. \[ \frac 1{b^n}\sum_{i=0}^{b^n-1}(L_b(i))^m=\sum_{j=1}^m\left\{m\atop j\right\}\left(\frac{\lfloor b/2\rfloor}b\right)^j\cdot j!\binom n j, \] where \(\{{m\atop j}\}\) denotes a Stirling number of the second kind, the number of ways to partition a set of \(m\) things into \(j\) nonempty subsets. The second sum is for \[ \frac 1{b^n}\sum_{i=0}^{b^n-1}(s_b(i))^m. \] The sums for \(b=10\) and \(m=0,1,\dots,8\) were given in [Fibonacci Q. 31, No. 4, 341-345 (1993; Zbl 0790.11006)]. The new formula for \(b=10\) and \(m=9\) e.g. is derived by using this result. Two other sums are for \[ \frac 1{b^n}\sum_{i=0}^{b^n-1}(s_b(i))^m\cdot(L_b(i))^m \quad\text{ and }\quad \sum_{i=1}^\infty\frac{C_b(a;a^i)}{(s_b(a))^i}=\frac{(s_b(a))}{b-1}, \] where \(C_b(a;a^i)\) denotes the base \(b\) carries in the normal multiplication algorithm of multiplying \(a\) and \(a^i\).