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

Divisibility rules

Revision as of 15:11, 25 November 2008 by ThinkFlow (talk | contribs) (→‎Divisibility Rule for 17)

These divisibility rules help determine when positive integers are divisible by particular other integers. All of these rules apply for base-10 only -- other bases have their own, different versions of these rules.


Divisibility Rule for 2 and Powers of 2

A number is divisible by $2^n$ if and only if the last ${n}$ digits of the number are divisible by $2^n$. Thus, in particular, a number is divisible by 2 if and only if its units digit is divisble by 2, i.e. if the number ends in 0, 2, 4, 6 or 8.

Proof

Divisibility Rule for 3 and 9

A number is divisible by 3 or 9 if and only 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

Divisibility Rule for 5 and Powers of 5

A number is divisible by $5^n$ if and only if the last $n$ digits are divisible by that power of 5.

Proof

Divisibility Rule for 7

Rule 1: Partition $N$ into 3 digit numbers from the right ($d_3d_2d_1,d_6d_5d_4,\dots$). The alternating sum ($d_3d_2d_1 - d_6d_5d_4 + d_9d_8d_7 - \dots$) is divisible by 7 if and only if $N$ is divisible by 7.

Proof

Rule 2: Truncate the last digit of $N$, double that digit, and subtract it from the rest of the number (or vice-versa). $N$ is divisible by 7 if and only if the result is divisible by 7.

Proof

Divisibility Rule for 11

A number is divisible by 11 if and only if the alternating sum of the digits is divisible by 11.

Proof

Divisibility Rule for 13

Rule 1: Truncate the last digit, multiply it by 4 and add it to the rest of the number. The result is divisible by 13 if and only if the original number was divisble by 13. This process can be repeated for large numbers, as with the second divisibility rule for 7.

Proof

Rule 2: Partition $N$ into 3 digit numbers from the right ($d_3d_2d_1,d_6d_5d_4,\dots$). The alternating sum ($d_3d_2d_1 - d_6d_5d_4 + d_9d_8d_7 - \dots$) is divisible by 13 if and only if $N$ is divisible by 13.

Proof

Divisibility Rule for 17

Truncate the last digit, multiply it by 5 and subtract from the remaining leading number. The number is divisible if and only if the result is divisible. The process can be repeated for any number.

Proof

Divisibility Rule for 19

Truncate the last digit, multiply it by 2 and add to the remaining leading number. The number is divisible if and only if the result is divisible. This can also be repeated for large numbers.

Proof

More general note for primes

For every prime number other than 2 and 5, there exists a rule similar to rule 2 for divisibility by 7. For a general prime $p$, there exists some number $q$ such that an integer is divisible by $p$ if and only if truncating the last digit, multiplying it by $q$ and subtracting it from the remaining number gives us a result divisible by $p$. Divisibility rule 2 for 7 says that for $p = 7$, $q = 2$. The divisibility rule for 11 is equivalent to choosing $q = 1$. The divisibility rule for 3 is equivalent to choosing $q = -1$. These rules can also be found under the appropriate conditions in number bases other than 10. Also note that these rules exist in two forms: if $q$ is replaced by $p - q$ then subtraction may be replaced with addition. We see one instance of this in the divisibility rule for 13: we could multiply by 9 and subtract rather than multiplying by 4 and adding.

More general note for composites

A number is divisible by $N$, where the prime factorization of $N$ is $p_1^{e_1}p_2^{e_2}\cdots p_n^{e_n}$, if the number is divisible by each of $p_1^{e_1}, p_2^{e_2},\ldots, p_n^{e_n}$.

Example

Is 55682168544 divisible by 36?

Solution

First, we find the prime factorization of 36 to be $2^2\cdot 3^2$. Thus we must check for divisibility by 4 and 9 to see if it's divisible by 36.

Since the last two digits, 44, of the number is divisible by 4, so is the entire number.

To check for divisibility by 9, we look to see if the sum of the digits is divisible by 9. The sum of the digits is 54 which is divisible by 9.

Thus, the number is divisible by both 4 and 9 and must be divisible by 36.

Example Problems


Resources

Books

Classes


See also

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