MathNet 2010 — Part 03 Question 106

Prove that for every natural number $m$, there exists a natural number $N$ such that for every natural number $b$ that $2 \le b \le 1389$, the sum of digits of $N$ in base $b$, is more than $m$.