Proof. Let r = S(n) and write n = 10e1+· · ·+10er , where the exponents e1, . . . , er
are not assumed distinct. Then mn is the sum of r numbers that are composed of
zeros and ones, each of which has digital sum S(m). Since r 9, this summation
does not involve carries. Thus S(mn) = S(m)r.