Digit sums of a huge power
Let be the sum of the decimal digits of , and let be the sum of the digits of . Find the sum of the digits of .
Fractions, decimals with at least 3 significant digits, and expressions such as sqrt(2)/2, e^-1 or pi/4.
A number and the sum of its digits leave the same remainder when divided by 9.
You cannot compute the number, but you can bound how large , and the final answer can be.
h
s Shown after a correct answer. Revealing it first marks the problem as seen, not solved.
Idea. Taking digit sums never changes the remainder modulo 9, so the answer has the same remainder as . Size bounds show the answer is small, and only one small number has the right remainder.
Step 1: the remainder. has digit sum 16, so . Since and , So , and the answer are all .
Step 2: sizes.
- , so it has at most 17,776 digits, and .
- A number at most 159,984 has at most six digits, the first one 0 or 1, so its digit sum is at most . So .
- A number at most 46 has digit sum at most (for 39). So .
Step 3. The only number from 1 to 12 that is is 7. So the answer is 7.