Let (a.k.a. a googolplex). Then can be expressed in the form for relatively prime positive integers and . Determine the sum of the digits of .
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.
It is easy to see, that:
l o g 1 0 G = l o g 1 0 1 0 1 0 1 0 0 = 1 0 1 0 0
Then, we can use the change of base theorem twice:
l o g 1 0 1 0 0 G = l o g 1 0 1 0 1 0 0 l o g 1 0 G = 1 0 0 1 0 1 0 0 = 1 0 9 8
And finally:
l o g 1 0 9 8 G = l o g 1 0 1 0 9 8 l o g 1 0 G = 9 8 1 0 1 0 0 = 4 9 5 × 1 0 9 9
Now, it is also easy to see that:
m = 5 × 1 0 9 9 and m = 4 9 (and that m and n are coprimes).
Therefore:
m + n = 5 × 1 0 9 9 + 4 9 = 5 0 0 . . . 0 0 4 9
(Our sum contains 99 - 2 = 97 zeroes in its decimal form.)
Hence, the sum of the digits:
S = 5 + 9 7 × 0 + 4 + 9 = 1 8