Problem

Source:

Tags: logarithms, modular arithmetic, number theory unsolved, number theory



For a positive integer $k$, let $s(k)$ denote the sum of the digits of $k$. Show that there are infinitely many natural numbers $n$ such that $s(2^n) > s(2^{n+1})$.