Difference between revisions of "Divisibility rules"
(added modular arithmetic link) |
|||
Line 59: | Line 59: | ||
== Divisibility Rule for 13 == | == Divisibility Rule for 13 == | ||
See rule 1 for divisibility by 7. A number is divisible by 13 if the same specified sum is divisible by 13. | See rule 1 for divisibility by 7. A number is divisible by 13 if the same specified sum is divisible by 13. | ||
+ | |||
+ | == See also == | ||
+ | * [[Number theory]] | ||
+ | * [[Modular arithmetic]] |
Revision as of 21:37, 29 June 2006
These divisibility rules help determine when integers are divisible by particular other integers.
Contents
Divisibility Rule for 2 and Powers of 2
A number is divisible by if the last
digits of the number are divisible by
.
Divisibility Rule for 3
A number is divisible by 3 if the sum of its digits is divisible by 3.
Divisibility Rule for 5 and Powers of 5
A number is divisible by if the last n digits are divisible by that power of 5.
Divisibility Rule for 9
A number is divisible by 9 if the sum of its digits is divisible by 9.
Proof
An understanding of basic modular arithmetic is necessary for this proof.
Consider, for example, the test for divisibility by :
Let be a positive integer. Then
is divisible by
if and only if the sum of the base-ten digits of
is divisible by
.
Arithmetic mod can be used to give an easy proof of this criterion:
Suppose that the base-ten representation of is
,
where is a digit for each
. Then the numerical value of
is given by
.
Now we know that, since , we have
(mod
). So by the "exponentiation" property above, we have
(mod
) for every
.
Therefore, by repeated uses of the "addition" and "multiplication" properties, we can write
(mod
).
Therefore, we have
(mod
).
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
.
Divisibility Rule for 11
A number is divisible by 11 if the alternating sum of the digits is divisible by 11.
Divisibility Rule for 7
Rule 1: Partition into 3 digit numbers from the right (
). If the alternating sum (
) is divisible by 7, then the number is divisible by 7.
Rule 2: Truncate the last digit of , and subtract twice that digit from the remaining number. If the result is divisible by 7, then the number is divisible by 7. This process can be repeated for large numbers.
Divisibility Rule for 13
See rule 1 for divisibility by 7. A number is divisible by 13 if the same specified sum is divisible by 13.