Prove that for every positive integer $m$ there exists a positive integer N such that $S(2^n) > m$ for every positive integer $n > N$, where by $S(x)$ we denote the sum of digits of a positive integer $x$.
Source:
Tags: number theory, 2nd edition
Prove that for every positive integer $m$ there exists a positive integer N such that $S(2^n) > m$ for every positive integer $n > N$, where by $S(x)$ we denote the sum of digits of a positive integer $x$.