7/12/2014

Divisibility by 9 - Math Notebook

MATH NOTEBOOK
Navigation
Mat h Not ebook
Divisibilit y Rules

Sea r ch t h i s si t e

Div isibility Rules

>

Divisibility by 9

Basic Theorem s
Modular Arithm etic
Div isibility by 3
Div isibility by 4

Rule for Divisibility by 9

Div isibility by 8

A number is divisible by 9 if the sum of its digits is divisible by 9. For large numbers this rule

Divisibilit y by 9
Div isibility by 1 1

can be applied again to the result. In addition, the final iteration will result in a 9.

Div isibility by 2 5
Div isibility by any Prim e

Examples

Files

A.) 2,880: 2 + 8 + 8 + 0 = 18, 1 + 8 = 9, so 9| 2,880.

Paper Sheet Geomet ry

B.) 3,564,213: 3+5+6+4+2+1+3=24, 2+4=6, so 9 does NOT divide 3,564,213.

Sit emap

Proof
The proof for the divisibility rule for 9 is essentially the same as the proof for the divisibility
rule for 3.
For any integer x written as an a3a2 a1 a0 we will prove that if 9|(a0 + a1 + a2+ a3 ... +
an), then 9|x and vice versa.
First, we can state that
x = a0 + a1 10 + a2 102 + a3 103 ... + an10n
Next if we let s be the sum of its digits then
s = a0 + a1 + a2 + a3 + ... + an .
So
x - s = (a0 - a0) + (a1 10 - a1 ) + (a2102 - a2) + ... + (an10n - an)
= a1 (10 - 1) + a2(102 - 1) + ... + an(10n - 1).
If we let bk = 10k - 1, then bk = 9...9 (9 occurs k times) and bk =9(11)
and we can rewrite

the previous equation as

x - s = a1 (b1 )+ a2(b2)+ ... + an (bn)
It follows that all numbers bk are divisible by 9, so the numbers akbk are also divisible by
9. Therefore, the sum of all the numbers akbk (which is x-s) is also divisible by 9.
Since x-s is divisible by 9, if x is divisible by 9, then so is s and vice versa.

Comments

Sig n in | Recen t Sit e A ct iv it y | Repor t A bu se | Pr in t Pa g e | Powered By Googl e Si t es

https://sites.google.com/site/mathematicsnotebook/divisibilityrules/divisibility9

1/1