Let represent and represent and this continues to the infinity. Given that is the digit sum of and is the digit sum of and so on and so forth, find the value of
Note
This question is based on a popular number theory question.
This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try
refreshing the page, (b) enabling javascript if it is disabled on your browser and,
finally, (c)
loading the
non-javascript version of this page
. We're sorry about the hassle.
First, the divisibility rule for nine states that all multiples of nine will have a digit sum of a multiple of 9. Thus if the digit sum is divisible by nine, then the digit sum of the digit sum will have to be divisible by nine. And so forth.
Now, we are trying to find 9 9 9 1 0 0 0 + 1 0 0 1 . Since 999 is divisible by 9, then by the divisibility rule of 9, the digit sum of all multiples of 999 will have to be divisible by nine and the digit sum of the digit sum will have to be divisible by 9 and so forth. Since all 9 9 9 n where n is a positive integer are multiples of 999, the rule stated in the previous sentence holds true. Thus the final digit sum of 9 9 9 1 0 0 0 + 1 0 0 1 will be either 9 or 0, the only single digit numbers divisible by 9. However, since no positive numbers add up to 0, the final digit sum can only be 9. Thus 9 is our answer.
I could post the proof stating that the 99,999,999th digit sum is enough to reach a single digit number, but I'm far too lazy. However, if anyone would like me to, feel free to ask and I'll be more than happy to post it.