The 'Lenny Conundrum' authors, in Round 234, wrote:A digital sum of a number is found by adding all of the digits of a number, then adding all the digits of that number, and so on, until you are left with a one-digit number. For example, the digital sum of the number 729 would be found like this: 7+2+ 9 = 18, and then 1+ 8 = 9.
What is the digital sum of the number that can be found by the following formula?
(9^62773 + 2)^83721
One of the uses of the described "digital sum" is to determine whether a number is divisible by 9. If the sum is divisible by 9 (or by 3), then the original number is divisible by 9 (or by 3). For instance:
. . . . .18: 1 + 8 = 9, which is divisible by 9 (and by 3)
. . . . .243: 2 + 4 + 3 = 9, which is divisible by 9 (and by 3)
...and so forth.
Obviously, any power of 9 is divisible by 9, so 9^x is always going to have a digital sum of 9. (In this case, x = 62773.)
Now consider any number of the form 9^x + 2, when raised to some odd power, 2n + 1. ("Odd" because 83721 is an odd number.) The expanded form, by the Binomial Theorem, will be as follows:
. . .(9^x + 2)^(2n + 1)
. . . . .= (9^x)^(2n + 1) + (binomial coefficient)((9^x)^(2n))(2^1) + ...
. . . . . . .+ (binomial coefficient)((9^x)^1)(2^(2n)) + 2^(2n + 1)
. . . . .= 9[(9^x)^(2n) + ... + (bin. coeff.)(9^1)(2^(2n))] + 2^(2n + 1)
. . . . .= 9[(stuff)] + (2^(2n))(2^1)
. . . . .= 9[(stuff)] + 2((2^2)^n)
. . . . .= 9[(stuff)] + 2(4^n)
Since anything with a factor of 9 is, by definition, divisible by 9, then the digital sum of the "9[(stuff)]" part is going to be "9". The "2(4^n)" part is twice some power of four. What will this give us?
. . . . .2(4^1) = 8
. . . . .2(4^2) = 2(16) = 32; 3 + 2 = 5
. . . . .2(4^3) = 2(64) = 128; 1 + 2 + 8 = 11, 1 + 1 = 2
. . . . .2(4^4) = 2(256) = 512; 5 + 1 + 2 = 8
. . . . .2(4^5) = 2(1024) = 2048; 2 + 0 + 4 + 8 = 14, 1 + 4 = 5
. . . . .2(4^6) = 2(4096) = 8192; 8 + 1 + 9 + 2 = 20, 2 + 0 = 2
So the digital sums appear to cycle as 8, 5, 2, 8, 5, 2,.... Thus, we need to determine where, in the cycle, 83721 appears. Since 83721 is odd, then 83721 = 2n + 1 for some value of n. Solving, we get:
. . . . .83721 = 2n + 1
. . . . .83720 = 2n
. . . . .41860 = n
Since the cycle of powers repeats every three powers (1, 2, 3, then 4, 5, 7, etc), we need to determine where 41860 falls.
. . . . .41860 = 41859 + 1 = 3(13953) + 1
That is, 41860 is one more than a multiple of 3. This puts the power of 83721 at the "8" in the cycle of digital sums for the 2(4^n) term.
Then we should get a sum, from the "9[(stuff)]" part, of "9", and a digital sum for the remaining term of "8". But are digital sums additive? That is, for numbers A and B with digital sums "a" and "b", respectively, is it true that the digital sum "c" for C = A + B will be equal to the sum of "a" and "b"?
It may be here assumed (and has been elsewhere proved) that this is the case. That is, the digital sum of (9^62773 + 2)^83721 will be the digital sum of the sum of the digital sums: 9 + 8 = 17, 1 + 7 = 8.
So the answer should be "8".
Please check my work.
Eliz.