If the sum of the digits of $n$ are divisible by 9, then $n$ is divisible by 9; help understanding part of a proof

Question

Let $n$ be a positive integer such that $n<1000$. If the sum of the digits of $n$ is divisible by 9, then $n$ is divisible by 9.

I got up to here:

$$100a + 10b + c = n$$ $$a+b+c = 9k,\quad k \in\mathbb{Z}$$

I didn't know what to do after this, so I consulted the solution

The next step is:

$$100a+10b+c = n = 9k +99a+9b = 9(k +11a+b)$$

I don't get how you can add $99a + 9b$ randomly, can someone please explain this for me?

The statement is true for any positive integer $n$, but from what you've written, are you assuming that $n$ is a three-digit number? — Zev Chonoles, Mar 01 '13 at 05:59

score 2 · Accepted Answer · answered Mar 01 '13 at 06:02

2

We are not adding it "randomly", we add it to both sides of the equation $$a+b+c=9k$$ to produce$$\begin{align*} (a+b+c)+99a+9b&=(9k)+99a+9b\\\\ 100a+10b+c&=9k+99a+9b\\\\ n&=9k+99a+9b\\\\ n&=9(k+11a+b) \end{align*}$$ The statement is true for any positive integer $n$, not just $n<1000$. The best way to prove that is through modular arithmetic.

answered Mar 01 '13 at 06:02

Zev Chonoles

132,937

This does not explain why it is added though, please explain the need to add 99a + 9b what is the reason for this? – AndrewMurray Mar 01 '13 at 06:06
And how do you know adding 99a + 9b will make 9k equal n? – AndrewMurray Mar 01 '13 at 06:07
To get $n$ on one side of the equation, and a quantity we know will be divisible by 9 on the other. – Zev Chonoles Mar 01 '13 at 06:07
Remember that you defined $a$, $b$, and $c$ so that $$n=100a+10b+c$$ – Zev Chonoles Mar 01 '13 at 06:07
To be honest, I am still lost, but this seems like a better answer than the other good answer, so I gave you a checkmark – AndrewMurray Mar 01 '13 at 06:12
You don't have to do that if you don't want to; there's no rush to accept an answer. Now, do you agree that we started out in this problem letting $a$, $b$, and $c$ be the hundreds, tens, and ones digit of $n$ respectively, so that $$n=100a+10b+c\quad ?$$ And do you also understand why $$(a+b+c)+(99a+9b)=100a+10b+c\quad ?$$ – Zev Chonoles Mar 01 '13 at 06:13
No I don't understand the second step – AndrewMurray Mar 01 '13 at 06:32
Addition is commutative; in other words, for any $x$ and $y$, we can rearrange them when we're adding: $$x+y=y+x$$ Using this fact multiple times to rearrange the terms, $$a+b+c+99a+9b=a+99a+b+9b+c$$ Now use that $$a+99a=100a,\qquad b+9b=10b.$$ – Zev Chonoles Mar 01 '13 at 06:34
Oh now I finally get it! Thanks so much. Here have an Oreo cookie as a reward! – AndrewMurray Mar 01 '13 at 06:38
Haha thanks :-) – Zev Chonoles Mar 01 '13 at 06:39

score 1 · Answer 2 · answered Mar 01 '13 at 06:02

1

I don't know why they are thinking about three digits. I would say let $n=10a+b$, where $b \lt 10$ (intuitively, $b$ is the ones digit and $a$ is all the rest). Then $n \pmod 9 \equiv 10a+b = (10-1)a +a +b \equiv a+b \pmod 9$ shows we can "strip off" all the lowest digits and add them up.

answered Mar 01 '13 at 06:02

Ross Millikan

383,099

Unfortunately, I still do not understand the need to strip off all the lowest digits. Can you rephrase the answer please (as a comment) – AndrewMurray Mar 01 '13 at 06:05
@AndrewMurray: An example is that the remainder on dividing $123$ by $9$ is the same as dividing $12+3=15$ by $9$ because the difference is $120-12=12(10-1)=108$ which is divisible by $9$. – Ross Millikan Mar 01 '13 at 06:07

score 0 · Answer 3 · answered Mar 01 '13 at 15:56

Simple way to see it: Take the number $N = \sum_{0 \le k \le n} d_k 10^k$ where the $d_k$ are the digits, modulo 9 you have: $$ N = \sum_{0 \le k \le n} d_k 10^k \equiv \sum_{0 \le k \le n} d_k \pmod{9} $$ since $10 \equiv 1 \pmod{9}$, and so $10^k \equiv 1 \pmod{9}$ for all $k$.

If the sum of the digits of $n$ are divisible by 9, then $n$ is divisible by 9; help understanding part of a proof

3 Answers3