The growth of digital sums of powers of 2

10 May 2016  ·  Radcliffe David G. ·

We give an elementary proof that the sum of the digits of $2^n$ in base 10 is greater than $\log_4 n$. In particular, the limit of the sum of digits of $2^n$ is infinite...

PDF Abstract
No code implementations yet. Submit your code now


Number Theory