Could anyone explain my prof's proof here for the induction of every natural number is congruent modulo 9 to the sum of its digits?

Question

enter image description here

I don't get where the + 99...9dk + part comes from especially.

score 3 · Accepted Answer · edited Dec 17 '12 at 18:10

3

$10^k=10000...0=9999999...9+1$

thus

$$10^kd_k=(9999999...9+1)d_k=999...9d_k+d_k \,.$$

edited Dec 17 '12 at 18:10

Cameron Buie

answered Dec 17 '12 at 17:41

N. S.

score 2 · Answer 2 · answered Dec 17 '12 at 17:41

2

Look at an example and maybe it becomes clear:

$$2000 = 2\cdot 1000 = 2\cdot(1+999) = 2+2\cdot 999$$

answered Dec 17 '12 at 17:41

Emily

But it doesn't show any 1. – Doug Smith Dec 17 '12 at 18:20
Yes it does. $$d_k\cdot 1000 = d^k \cdot (1+999) = d_k + 999d_k$$ The 1 is wrapped into the $d_k$. – Emily Dec 17 '12 at 18:21
In my example, $d_k = 2$. – Emily Dec 17 '12 at 18:22

score 0 · Answer 3 · answered Dec 17 '12 at 17:57

0

He is just saying that $$10^k=(10^k-1)+1=(999\ldots 9)+1$$ For example, $10^3=999+1$. He is also factoring out $d_k$ in this step.

answered Dec 17 '12 at 17:57

cderwin

3 Answers3