Hearted Youtube comments on Mathologer (@Mathologer) channel.
-
124
-
124
-
123
-
122
-
121
-
121
-
120
-
119
-
118
-
118
-
118
-
118
-
117
-
117
-
116
-
116
-
114
-
113
-
113
-
112
-
112
-
111
-
110
-
110
-
109
-
109
-
109
-
107
-
107
-
107
-
107
-
107
-
107
-
106
-
106
-
105
-
103
-
103
-
103
-
102
-
101
-
101
-
101
-
101
-
100
-
100
-
Solution to the problem at 16:14
Start with this equation, which is true for every value of k:
5^k * 2^k = 10^k
The digital root of any power of 10 is 1, so
DR(5^k * 2^k) = 1
Using the multiplication rule you explained earlier,
DR(DR(5^k) * DR(2^k)) = 1
In other words, DR(5^k) and DR(2^k) have to be multiplicative inverses of each other.
Taking the βdigital rootβ of an integer is equivalent to modding it by 9. (The only difference is that if DR(n) = 9, then n mod 9 = 0.) In mod-9 arithmetic, every number except for 0, 3, and 6 has a unique multiplicative inverse. Since the digital root of a power of 2 is never 3, 6, or 9, this means that DR(2^k) completely determines DR(5^k).
As k increases, the value of DR(2^k) cycles as follows:
2 4 8 7 5 1 2 4 8 7 5 1 β¦
Taking the multiplicative inverse of each number above gives the values of DR(5^k).
5 7 8 4 2 1 5 7 8 4 2 1 β¦
So DR(2^k) and DR(5^k) cycle through the same values, but in reverse.
100
-
99
-
99
-
98