Problem #12

Let S(n) denote the sum of the (base 10) digits of n. Show that for any positive integer m there is an n such that

For example, when m = 4, n = 13 works since 13² = 169 and S(169)/S(13) = 16/4 = 4.

The solution will be posted shortly.

Back to the Archives