Art of Problem Solving
AoPS Online
Math texts, online classes, and more
for students in grades 5-12.
Visit AoPS Online ‚
Books for Grades 5-12 Online Courses
Beast Academy
Engaging math books and online learning
for students ages 6-13.
Visit Beast Academy ‚
Books for Ages 6-13 Beast Academy Online
AoPS Academy
Small live classes for advanced math
and language arts learners in grades 2-12.
Visit AoPS Academy ‚
Find a Physical Campus Visit the Virtual Campus

Difference between revisions of "Divisibility rules"

(added resources)
(added to see also)
Line 73: Line 73:
 
* [[Number theory]]
 
* [[Number theory]]
 
* [[Modular arithmetic]]
 
* [[Modular arithmetic]]
 +
* [[Math books]]
 +
* [[Mathematics competitions]]

Revision as of 20:51, 29 June 2006

These divisibility rules help determine when integers are divisible by particular other integers.


Divisibility Rule for 2 and Powers of 2

A number is divisible by $2^n$ if the last ${n}$ digits of the number are divisible by $2^n$.


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 $5^n$ 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 $9$:

Let $N$ be a positive integer. Then $N$ is divisible by $9$ if and only if the sum of the base-ten digits of $N$ is divisible by $9$.

Arithmetic mod $9$ can be used to give an easy proof of this criterion:

Suppose that the base-ten representation of $N$ is

$N = a_k a_{k-1} \cdots a_2 a_1 a_0$,

where $a_i$ is a digit for each $i$. Then the numerical value of $N$ 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$.

Now we know that, since $10 - 1 = 9$, we have $10 \equiv 1$ (mod $9$). So by the "exponentiation" property above, we have $10^j \equiv 1^j \equiv 1$ (mod $9$) for every $j$.

Therefore, by repeated uses of the "addition" and "multiplication" properties, 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$ (mod $9$).

Therefore, we have

$N \equiv a_k + a_{k-1} + \cdots + a_1 + a_0$ (mod $9$).

That is, $N$ differs from the sum of its digits by a multiple of $9$. It follows, then, that $N$ is a multiple of $9$ if and only if the sum of its digits is a multiple of $9$.


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 $n$ into 3 digit numbers from the right ($d_3d_2d_1,d_6d_5d_4,\dots$). If the alternating sum ($d_3d_2d_1 - d_6d_5d_4 + d_9d_8d_7 - \dots$) is divisible by 7, then the number is divisible by 7.

Rule 2: Truncate the last digit of ${n}$, 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.


Resources

Books

Classes


See also

Retrieved from "https://artofproblemsolving.com/wiki/index.php?title=Divisibility_rules&oldid=5388"