Powers of general digital sums

Let m ₀, m ₁, m ₂, ... be positive integers with m _i ≥ 2 for all i. It is well known that each nonnegative integer n can be uniquely represented as

$ n = a_0 + a_1 m_0 + a_2 m_0 m_1 + \cdots + a_t m_0 m_1 m_2 \cdots m_{t - 1} $ n = a_0 + a_1 m_0 + a_2 m_0 m_1 + \cdots + a_t m_0 m_1 m_2 \cdots m_{t - 1}
Keywords:	digital sum  arithmetic function  asymptotic formula
本文献已被 维普 SpringerLink 等数据库收录！