Why the digit sum tells you divisibility by 9
Need a hint?
Powers of 10 all leave remainder 1 modulo 9.
A number and its digit sum leave the same remainder on division by 9 (and by 3): 12345 has digit sum 15 and remainder 6.
How to work it out
Since , every power . Write with digits :
(1)Example: has digit sum 15, and 15 leaves remainder 6; , so the remainder of 12345 is 6. (The same works for 3, since 3 divides 9.)
LaTeX source of the formulas on this page
\[ n\equiv\text{digit sum}\pmod 9 \]
\[ n\equiv d_k+\cdots+d_1+d_0\pmod9 \]Questions
What is the answer to: Why the digit sum tells you divisibility by 9?
A number and its digit sum leave the same remainder on division by 9 (and by 3): 12345 has digit sum 15 and remainder 6.
What is the key idea?
10 ≡ 1 (mod 9), so each digit counts only once.
Is there a hint?
Powers of 10 all leave remainder 1 modulo 9.