Difference between revisions of "Divisibility rules/Rule for 3 and 9 proof"
(Added category) |
|||
(2 intermediate revisions by 2 users not shown) | |||
Line 2: | Line 2: | ||
== Proof == | == Proof == | ||
− | |||
''An understanding of [[Introduction to modular arithmetic | basic modular arithmetic]] is necessary for this proof.'' | ''An understanding of [[Introduction to modular arithmetic | basic modular arithmetic]] is necessary for this proof.'' | ||
Line 15: | Line 14: | ||
<center><math>N = a_k \cdot 10^k + a_{k-1} \cdot 10^{k-1} + \cdots + a_1 \cdot 10^1 + a_0 \cdot 10^0</math>.</center> | <center><math>N = a_k \cdot 10^k + a_{k-1} \cdot 10^{k-1} + \cdots + a_1 \cdot 10^1 + a_0 \cdot 10^0</math>.</center> | ||
− | Now we know that, since <math>10 - 1 = 9</math>, we have <math>10 \equiv 1</math> (mod <math>9</math>) | + | Now we know that, since <math>10 - 1 = 9</math>, we have <math>10 \equiv 1</math> (mod <math>9</math>) and so we have <math> 10^{j}\equiv 1^{j}\equiv 1 \pmod{9} </math> for every <math>j</math>. |
− | Therefore | + | Therefore, we can write |
<center><math>a_k \cdot 10^k + a_{k-1} \cdot 10^{k-1} + \cdots + a_1 \cdot 10^1 + a_0 \cdot 10^0 \equiv a_k \cdot 1 + a_{k-1} \cdot 1 + \cdots + a_1 \cdot 1 + a_0 \cdot 1 \pmod{9} </math>.</center> | <center><math>a_k \cdot 10^k + a_{k-1} \cdot 10^{k-1} + \cdots + a_1 \cdot 10^1 + a_0 \cdot 10^0 \equiv a_k \cdot 1 + a_{k-1} \cdot 1 + \cdots + a_1 \cdot 1 + a_0 \cdot 1 \pmod{9} </math>.</center> | ||
Line 31: | Line 30: | ||
== See also == | == See also == | ||
* [[Divisibility rules | Back to divisibility rules]] | * [[Divisibility rules | Back to divisibility rules]] | ||
+ | [[Category:Divisibility Rules]] |
Latest revision as of 20:29, 6 March 2014
A number is divisible by 3 or 9 if the sum of its digits is divisible by 3 or 9, respectively. Note that this does not work for higher powers of 3. For instance, the sum of the digits of 1899 is divisible by 27, but 1899 is not itself divisible by 27.
Proof
An understanding of basic modular arithmetic is necessary for this proof.
Arithmetic mod can be used to give an easy proof of this criterion:
Suppose that the base-ten representation of is
![$N = a_k a_{k-1} \cdots a_2 a_1 a_0$](http://latex.artofproblemsolving.com/0/7/0/0704e02977f4ffc5d660d78d057acec0e99f700c.png)
where is a digit for each
. Then the numerical value of
is given by
![$N = a_k \cdot 10^k + a_{k-1} \cdot 10^{k-1} + \cdots + a_1 \cdot 10^1 + a_0 \cdot 10^0$](http://latex.artofproblemsolving.com/0/7/9/079296cd7f9102410f3f960d24a53ced70fd1ae2.png)
Now we know that, since , we have
(mod
) and so we have
for every
.
Therefore, we can write
![$a_k \cdot 10^k + a_{k-1} \cdot 10^{k-1} + \cdots + a_1 \cdot 10^1 + a_0 \cdot 10^0 \equiv a_k \cdot 1 + a_{k-1} \cdot 1 + \cdots + a_1 \cdot 1 + a_0 \cdot 1 \pmod{9}$](http://latex.artofproblemsolving.com/b/8/e/b8e579dd3990e7b7f3384701400a4e4f7640d81c.png)
Therefore, we have
![$N \equiv a_k + a_{k-1} + \cdots + a_1 + a_0 \pmod{9}$](http://latex.artofproblemsolving.com/c/3/b/c3b22803a975858194acd5241c6477e66b9feb5a.png)
That is, differs from the sum of its digits by a multiple of
. It follows, then, that
is a multiple of
if and only if the sum of its digits is a multiple of
.
Since we also have , the same proof also gives the divisibility rule for 3. The proof fails for 27 because
.