Let
.
Let
be the sum of the digits of
.
Let
be the sum of the digits of
.
Let
be the sum of the digits of
.
What is ?
Hint: divisibility rules .
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.
By the divisibility rules , we know that the sum of the digits divided by 9 will leave the same remainder as when the number itself is divided by 9.
Note that 2 0 1 6 is a multiple of 9, so the sum of the digits of P , Q , must be a multiple of 9. By the same logic, since Q is a multiple of 9, so is R and then so is S .
We know that S is a positive integer (iteratively summing the digits can never result in 0), but it could be 9 , 1 8 , 2 7 , 3 6 , …
However, note that the sum of the digits of a number is less than 10 times the number of digits it has. Thus, Q < 1 0 ⋅ ⌈ lo g 1 0 2 0 1 6 2 0 1 6 ⌉ = 1 0 ⋅ ⌈ 2 0 1 6 lo g 1 0 2 0 1 6 ⌉ < 1 0 5 .
Since Q < 1 0 5 , it has at most 5 digits. Thus, R < 1 0 ⋅ 5 = 5 0 , so the maximum sum of the digits of R is 4 + 9 = 1 3 , so S ≤ 1 3 . But since we determined that S is a positive multiple of 9, S = 9 .
Remark: There are obviously tighter bounds that can be achieved throughout this solution, but they're not needed to solve this problem.