MathDB
S 36

Source:

May 25, 2007
modular arithmeticinductionlimitMiscellaneous Problems

Problem Statement

For every natural number nn, denote Q(n)Q(n) the sum of the digits in the decimal representation of nn. Prove that there are infinitely many natural numbers kk with Q(3k)>Q(3k+1)Q(3^{k})>Q(3^{k+1}).