4/17/2019 Divisibility rule - Wikipedia

Divisibility rule
A divisibility rule is a shorthand way of determining whether a given integer is divisible by a fixed divisor without
performing the division, usually by examining its digits. Although there are divisibility tests for numbers in any radix,
or base, and they are all different, this article presents rules and examples only for decimal, or base 10, numbers.
Martin Gardner explained and popularized these rules in his September 1962 "Mathematical Games" column in
Scientific American.[1]

Contents
Divisibility rules for numbers 1–30
Step-by-step examples
Divisibility by 2
Divisibility by 3 or 9
Divisibility by 4
Divisibility by 5
Divisibility by 6
Divisibility by 7
Divisibility by 13
Beyond 30
Composite divisors
Prime divisors
Notable examples
Generalized divisibility rule
Proofs
Proof using basic algebra
Proof using modular arithmetic
See also
References
Sources
External links

Divisibility rules for numbers 1–30

The rules given below transform a given number into a generally smaller number, while preserving divisibility by the
divisor of interest. Therefore, unless otherwise noted, the resulting number should be evaluated for divisibility by the
same divisor. In some cases the process can be iterated until the divisibility is obvious; for others (such as examining
the last n digits) the result must be examined by other means.

For divisors with multiple rules, the rules are generally ordered first for those appropriate for numbers with many
digits, then those useful for numbers with fewer digits.

Note: To test divisibility by any number that can be expressed as 2n or 5n, in which n is a positive integer, just examine
the last n digits.

https://en.wikipedia.org/wiki/Divisibility_rule 1/20
4/17/2019 Divisibility rule - Wikipedia

Note: To test divisibility by any number expressed as the product of prime factors , we can separately test for
divisibility by each prime to its appropriate power. For example, testing divisibility by 24 (24 = 8*3 = 23*3) is
equivalent to testing divisibility by 8 (23) and 3 simultaneously, thus we need only show divisibility by 8 and by 3 to
prove divisibility by 24.

https://en.wikipedia.org/wiki/Divisibility_rule 2/20
4/17/2019 Divisibility rule - Wikipedia

Divisor Divisibility condition Examples

1 No special condition. Any integer is divisible by 1. 2 is divisible by 1.

2 The last digit is even (0, 2, 4, 6, or 8).[2][3] 1294: 4 is even.

405 → 4 + 0 + 5 = 9 and 636 → 6 + 3 + 6 = 15

which both are clearly divisible by 3.
Sum the digits. The result must be divisible by 16,499,205,854,376 →
3.[2][4][5] 1+6+4+9+9+2+0+5+8+5+4+3+7+6 sums to 69
→ 6 + 9 = 15 → 1 + 5 = 6, which is clearly
3 divisible by 3.
Using the example above: 16,499,205,854,376
Subtract the quantity of the digits 2, 5, and 8 in the has four of the digits 1, 4 and 7 and four of the
number from the quantity of the digits 1, 4, and 7 in digits 2, 5 and 8; ∴ Since 4 − 4 = 0 is a multiple
the number. The result must be divisible by 3. of 3, the number 16,499,205,854,376 is
divisible by 3.
The last two digits form a number that is divisible by
40,832: 32 is divisible by 4.
4.[2][3]
If the tens digit is even, the ones digit must be 0, 4, or
4 8. 40,832: 3 is odd, and the last digit is 2.
If the tens digit is odd, the ones digit must be 2 or 6.
Twice the tens digit, plus the ones digit is divisible by
40832: 2 × 3 + 2 = 8, which is divisible by 4.
4.

5 The last digit is 0 or 5.[2][3] 495: the last digit is 5.

1458: 1 + 4 + 5 + 8 = 18, so it is divisible by 3

6 It is divisible by 2 and by 3.[6] and the last digit is even, hence the number is
divisible by 6.
Forming an alternating sum of blocks of three from
1,369,851: 851 − 369 + 1 = 483 = 7 × 69
right to left gives a multiple of 7[5][7]
Subtracting 2 times the last digit from the rest gives a
483: 48 − (3 × 2) = 42 = 7 × 6.
multiple of 7. (Works because 21 is divisible by 7.)
Adding 5 times the last digit to the rest gives a
483: 48 + (3 × 5) = 63 = 7 × 9.
multiple of 7. (Works because 49 is divisible by 7.)
483: 4×3 + 8 = 20 remainder 6,
Adding 3 times the first digit to the next gives a 203: 2×3 + 0 = 6,
multiple of 7. (This works because 10a + b − 7a = 3a
+ b; the last number has the same remainder.) 63: 6×3 + 3 = 21.
7
Adding the last two digits to twice the rest gives a 483,595: 95 + (2 × 4835) = 9765: 65 + (2 × 97)
multiple of 7. (Works because 98 is divisible by 7.) = 259: 59 + (2 × 2) = 63.
Multiply each digit (from right to left) by the digit in the
corresponding position in this pattern (from left to
483,595: (4 × (-2)) + (8 × (-3)) + (3 × (-1)) + (5
right): 1, 3, 2, -1, -3, -2 (repeating for digits beyond the
× 2) + (9 × 3) + (5 × 1) = 7.
hundred-thousands place). Adding the results gives a
multiple of 7.
Adding the last digit to 3 times the rest gives a
224: 4 + (3 x 22) = 70
multiple of 7. [8]
Adding 3 times the last digit to 2 times the rest gives a
245: (3 x 5) + (2 x 24) = 7 x 9 = 63
multiple of 7. [8]
8 If the hundreds digit is even, the number formed by
624: 24.
the last two digits must be divisible by 8.
If the hundreds digit is odd, the number obtained by
352: 52 + 4 = 56.
the last two digits plus 4 must be divisible by 8.
Add the last digit to twice the rest. The result must be 56: (5 × 2) + 6 = 16.

https://en.wikipedia.org/wiki/Divisibility_rule 3/20
4/17/2019 Divisibility rule - Wikipedia

divisible by 8.

The last three digits are divisible by 8.[2][3] 34,152: Examine divisibility of just 152: 19 × 8

Add four times the hundreds digit to twice the tens

digit to the ones digit. The result must be divisible by 34,152: 4 × 1 + 5 × 2 + 2 = 16
8.
Sum the digits. The result must be divisible by
9 2880: 2 + 8 + 8 + 0 = 18: 1 + 8 = 9.
9.[2][4][5]

10 The ones digit is 0.[3] 130: the ones digit is 0.

Form the alternating sum of the digits. The result must

918,082: 9 − 1 + 8 − 0 + 8 − 2 = 22 = 2 × 11.
be divisible by 11.[2][5]
Add the digits in blocks of two from right to left. The
627: 6 + 27 = 33 = 3 × 11.
result must be divisible by 11.[2]
Subtract the last digit from the rest. The result must be
627: 62 − 7 = 55 = 5 × 11.
divisible by 11.
11 Add the last digit to the hundreds place (add 10 times
the last digit to the rest). The result must be divisible 627: 62 + 70 = 132: 13 + 20 = 33 = 3 × 11.
by 11.
If the number of digits is even, add the first and
918,082: the number of digits is even (6) →
subtract the last digit from the rest. The result must be
1808 + 9 − 2 = 1815: 81 + 1 − 5 = 77 = 7 × 11
divisible by 11.
If the number of digits is odd, subtract the first and last 14,179: the number of digits is odd (5) → 417
digit from the rest. The result must be divisible by 11. − 1 − 9 = 407 = 37 × 11

It is divisible by 3 and by 4.[6] 324: it is divisible by 3 and by 4.

12
Subtract the last digit from twice the rest. The result
324: 32 × 2 − 4 = 60 = 5 × 12.
must be divisible by 12.
Form the alternating sum of blocks of three from right
2,911,272: 272 - 911 + 2 = -637
to left. The result must be divisible by 13.[7]
Add 4 times the last digit to the rest. The result must
637: 63 + 7 × 4 = 91, 9 + 1 × 4 = 13.
be divisible by 13.
13
Subtract the last two digits from four times the rest.
923: 9 × 4 - 23 = 13.
The result must be divisible by 13.
Subtract 9 times the last digit from the rest. The result
637: 63 - 7 × 9 = 0.
must be divisible by 13.

It is divisible by 2 and by 7.[6] 224: it is divisible by 2 and by 7.

14
Add the last two digits to twice the rest. The result 364: 3 × 2 + 64 = 70.
must be divisible by 14. 1764: 17 × 2 + 64 = 98.

15 It is divisible by 3 and by 5.[6] 390: it is divisible by 3 and by 5.

If the thousands digit is even, examine the number

254,176: 176.
formed by the last three digits must be divisible by 16.
If the thousands digit is odd, the number formed by
3408: 408 + 8 = 416.
the last three digits plus 8 must be divisible by 16.
16
176: 1 × 4 + 76 = 80.
Add the last two digits to four times the rest. The
result must be divisible by 16. 1168: 11 × 4 + 68 = 112.

The last four digits must be divisible by 16.[2][3] 157,648: 7,648 = 478 × 16.

Subtract 5 times the last digit from the rest. 221: 22 − 1 × 5 = 17.
17
Subtract the last two digits from two times the rest. 4,675: 46 × 2 - 75 = 17.

18 It is divisible by 2 and by 9.[6] 342: it is divisible by 2 and by 9.

https://en.wikipedia.org/wiki/Divisibility_rule 4/20
4/17/2019 Divisibility rule - Wikipedia

19 Add twice the last digit to the rest. 437: 43 + 7 × 2 = 57.

Add 4 times the last two digits to the rest. 6935: 69 + 35 × 4 = 209.
It is divisible by 10, and the tens digit is even. 360: is divisible by 10, and 6 is even.
20 The number formed by the last two digits is divisible
480: 80 is divisible by 20.
by 20.[3]
Subtract twice the last digit from the rest. 168: 16 − 8 × 2 = 0.
21
It is divisible by 3 and by 7.[6] 231: it is divisible by 3 and by 7.

22 It is divisible by 2 and by 11.[6] 352: it is divisible by 2 and by 11.

Add 7 times the last digit to the rest. 3128: 312 + 8 × 7 = 368. 36 + 8 × 7 = 92.
23
Add 3 times the last two digits to the rest. 1725: 17 + 25 × 3 = 92.

24 It is divisible by 3 and by 8.[6] 552: it is divisible by 3 and by 8.

25 Examine the number formed by the last two digits.[3] 134,250: 50 is divisible by 25.

26 It is divisible by 2 and by 13.[6] 156: it is divisible by 2 and by 13.

Sum the digits in blocks of three from right to left. 2,644,272: 2 + 644 + 272 = 918.
27 Subtract 8 times the last digit from the rest. 621: 62 − 1 × 8 = 54.
Subtract the last two digits from 8 times the rest. 6507: 65 × 8 - 7 = 520 - 7 = 513 = 27 × 19.

28 It is divisible by 4 and by 7.[6] 140: it is divisible by 4 and by 7.

Add three times the last digit to the rest. 348: 34 + 8 × 3 = 58.
29
Add 9 times the last two digits to the rest. 5510: 55 + 10 × 9 = 145 = 5 × 29.

30 It is divisible by 3 and by 10.[6] 270: it is divisible by 3 and by 10.

Step-by-step examples

Divisibility by 2
First, take any number (for this example it will be 376) and note the last digit in the number, discarding the other
digits. Then take that digit (6) while ignoring the rest of the number and determine if it is divisible by 2. If it is
divisible by 2, then the original number is divisible by 2.

Example

1. 376 (The original number)

2. 37 6 (Take the last digit)
3. 6 ÷ 2 = 3 (Check to see if the last digit is divisible by 2)
4. 376 ÷ 2 = 188 (If the last digit is divisible by 2, then the whole number is divisible by 2)

Divisibility by 3 or 9
First, take any number (for this example it will be 492) and add together each digit in the number (4 + 9 + 2 = 15).
Then take that sum (15) and determine if it is divisible by 3. The original number is divisible by 3 (or 9) if and only if
the sum of its digits is divisible by 3 (or 9).

If a number is a multiplication of 3 consecutive numbers then that number is always divisible by 3. This is useful for
when the number takes the form of (n × (n − 1) × (n + 1))

Ex.

https://en.wikipedia.org/wiki/Divisibility_rule 5/20
4/17/2019 Divisibility rule - Wikipedia

1. 492 (The original number)

2. 4 + 9 + 2 = 15 (Add each individual digit together)
3. 15 is divisible by 3 at which point we can stop. Alternatively we can continue using the same method if the
number is still too large:
4. 1 + 5 = 6 (Add each individual digit together)
5. 6 ÷ 3 = 2 (Check to see if the number received is divisible by 3)
6. 492 ÷ 3 = 164 (If the number obtained by using the rule is divisible by 3, then the whole number is divisible by 3)
Ex.

1. 336 (The original number)

2. 6 × 7 × 8 = 336
3. 336 ÷ 3 = 112

Divisibility by 4
The basic rule for divisibility by 4 is that if the number formed by the last two digits in a number is divisible by 4, the
original number is divisible by 4;[2][3] this is because 100 is divisible by 4 and so adding hundreds, thousands, etc. is
simply adding another number that is divisible by 4. If any number ends in a two digit number that you know is
divisible by 4 (e.g. 24, 04, 08, etc.), then the whole number will be divisible by 4 regardless of what is before the last
two digits.

Alternatively, one can simply divide the number by 2, and then check the result to find if it is divisible by 2. If it is, the
original number is divisible by 4. In addition, the result of this test is the same as the original number divided by 4.

Ex.
General rule

1. 2092 (The original number)

2. 20 92 (Take the last two digits of the number, discarding any other digits)
3. 92 ÷ 4 = 23 (Check to see if the number is divisible by 4)
4. 2092 ÷ 4 = 523 (If the number that is obtained is divisible by 4, then the original number is divisible by 4)
Alternative example

1. 1720 (The original number)

2. 1720 ÷ 2 = 860 (Divide the original number by 2)
3. 860 ÷ 2 = 430 (Check to see if the result is divisible by 2)
4. 1720 ÷ 4 = 430 (If the result is divisible by 2, then the original number is divisible by 4)

Divisibility by 5
Divisibility by 5 is easily determined by checking the last digit in the number (475), and seeing if it is either 0 or 5. If
the last number is either 0 or 5, the entire number is divisible by 5.[2][3]

If the last digit in the number is 0, then the result will be the remaining digits multiplied by 2. For example, the
number 40 ends in a zero (0), so take the remaining digits (4) and multiply that by two (4 × 2 = 8). The result is the
same as the result of 40 divided by 5(40/5 = 8).

If the last digit in the number is 5, then the result will be the remaining digits multiplied by two (2), plus one (1). For
example, the number 125 ends in a 5, so take the remaining digits (12), multiply them by two (12 × 2 = 24), then add
one (24 + 1 = 25). The result is the same as the result of 125 divided by 5 (125/5=25).

Ex.
If the last digit is 0

https://en.wikipedia.org/wiki/Divisibility_rule 6/20
4/17/2019 Divisibility rule - Wikipedia

1. 110 (The original number)

2. 11 0 (Take the last digit of the number, and check if it is 0 or 5)
3. 11 0 (If it is 0, take the remaining digits, discarding the last)
4. 11 × 2 = 22 (Multiply the result by 2)
5. 110 ÷ 5 = 22 (The result is the same as the original number divided by 5)
If the last digit is 5

1. 85 (The original number)

2. 8 5 (Take the last digit of the number, and check if it is 0 or 5)
3. 8 5 (If it is 5, take the remaining digits, discarding the last)
4. 8 × 2 = 16 (Multiply the result by 2)
5. 16 + 1 = 17 (Add 1 to the result)
6. 85 ÷ 5 = 17 (The result is the same as the original number divided by 5)

Divisibility by 6
Divisibility by 6 is determined by checking the original number to see if it is both an even number (divisible by 2) and
divisible by 3.[6] This is the best test to use.

If the number is divisible by six, take the original number (246) and divide it by two (246 ÷ 2 = 123). Then, take that
result and divide it by three (123 ÷ 3 = 41). This result is the same as the original number divided by six (246 ÷ 6 = 41).

Ex.

General rule

1. 324 (The original number)

2. 324 ÷ 3 = 108 (Check to see if the original number is divisible by 3)
3. 324 ÷ 2 = 162 OR 108 ÷ 2 = 54 (Check to see if either the original number or the result of the previous equation is
divisible by 2)
4. 324 ÷ 6 = 54 (If either of the tests in the last step are true, then the original number is divisible by 6. Also, the
result of the second test returns the same result as the original number divided by 6)

Finding a remainder of a number when divided by 6

(1, −2, −2, −2, −2, and −2 goes on for the rest) No period. -- Minimum magnitude sequence
(1, 4, 4, 4, 4, and 4 goes on for the rest) -- Positive sequence
Multiply the right most digit by the left most digit in the sequence and multiply the second
right most digit by the second left most digit in the sequence and so on.
Next, compute the sum of all the values and take the remainder on division by 6.

Example: What is the remainder when 1036125837 is divided by 6?

Multiplication of the rightmost digit = 1 × 7 = 7

Multiplication of the second rightmost digit = 3 × −2 = −6
Third rightmost digit = −16
Fourth rightmost digit = −10
Fifth rightmost digit = −4
Sixth rightmost digit = −2
Seventh rightmost digit = −12
Eighth rightmost digit = −6
Ninth rightmost digit = 0
Tenth rightmost digit = −2
Sum = −51
−51 ≡ 3 (mod 6)
Remainder = 3

https://en.wikipedia.org/wiki/Divisibility_rule 7/20
4/17/2019 Divisibility rule - Wikipedia

Divisibility by 7
Divisibility by 7 can be tested by a recursive method. A number of the form 10x + y is divisible by 7 if and only if x − 2y
is divisible by 7. In other words, subtract twice the last digit from the number formed by the remaining digits.
Continue to do this until a number known to be divisible by 7 is obtained. The original number is divisible by 7 if and
only if the number obtained using this procedure is divisible by 7. For example, the number 371: 37 − (2×1)
= 37 − 2 = 35; 3 − (2 × 5) = 3 − 10 = −7; thus, since −7 is divisible by 7, 371 is divisible by 7.

Another method is multiplication by 3. A number of the form 10x + y has the same remainder when divided by 7 as
3x + y. One must multiply the leftmost digit of the original number by 3, add the next digit, take the remainder when
divided by 7, and continue from the beginning: multiply by 3, add the next digit, etc. For example, the number 371:
3×3 + 7 = 16 remainder 2, and 2×3 + 1 = 7. This method can be used to find the remainder of division by 7.

A more complicated algorithm for testing divisibility by 7 uses the fact that 100 ≡ 1, 101 ≡ 3, 102 ≡ 2, 103 ≡ 6, 104 ≡ 4,
105 ≡ 5, 106 ≡ 1, ... (mod 7). Take each digit of the number (371) in reverse order (173), multiplying them successively
by the digits 1, 3, 2, 6, 4, 5, repeating with this sequence of multipliers as long as necessary (1, 3, 2, 6, 4, 5, 1, 3, 2, 6, 4,
5, ...), and adding the products (1×1 + 7×3 + 3×2 = 1 + 21 + 6 = 28). The original number is divisible by 7 if and only if
the number obtained using this procedure is divisible by 7 (hence 371 is divisible by 7 since 28 is).[9]

This method can be simplified by removing the need to multiply. All it would take with this simplification is to
memorize the sequence above (132645...), and to add and subtract, but always working with one-digit numbers.

The simplification goes as follows:

Take for instance the number 371

Change all occurrences of 7, 8 or 9 into 0, 1 and 2, respectively. In this example, we get: 301. This second step
may be skipped, except for the left most digit, but following it may facilitate calculations later on.
Now convert the first digit (3) into the following digit in the sequence 13264513... In our example, 3 becomes 2.
Add the result in the previous step (2) to the second digit of the number, and substitute the result for both digits,
leaving all remaining digits unmodified: 2 + 0 = 2. So 301 becomes 21.
Repeat the procedure until you have a recognizable multiple of 7, or to make sure, a number between 0 and 6.
So, starting from 21 (which is a recognizable multiple of 7), take the first digit (2) and convert it into the following in
the sequence above: 2 becomes 6. Then add this to the second digit: 6 + 1 = 7.
If at any point the first digit is 8 or 9, these become 1 or 2, respectively. But if it is a 7 it should become 0, only if
no other digits follow. Otherwise, it should simply be dropped. This is because that 7 would have become 0, and
numbers with at least two digits before the decimal dot do not begin with 0, which is useless. According to this,
our 7 becomes 0.
If through this procedure you obtain a 0 or any recognizable multiple of 7, then the original number is a multiple of 7.
If you obtain any number from 1 to 6, that will indicate how much you should subtract from the original number to get
a multiple of 7. In other words, you will find the remainder of dividing the number by 7. For example, take the
number 186:

First, change the 8 into a 1: 116.

Now, change 1 into the following digit in the sequence (3), add it to the second digit, and write the result instead of
both: 3 + 1 = 4. So 116 becomes now 46.
Repeat the procedure, since the number is greater than 7. Now, 4 becomes 5, which must be added to 6. That
is 11.
Repeat the procedure one more time: 1 becomes 3, which is added to the second digit (1): 3 + 1 = 4.
Now we have a number lower than 7, and this number (4) is the remainder of dividing 186/7. So 186 minus 4, which is
182, must be a multiple of 7.

Note: The reason why this works is that if we have: a+b=c and b is a multiple of any given number n, then a and c
will necessarily produce the same remainder when divided by n. In other words, in 2 + 7 = 9, 7 is divisible by 7. So 2
and 9 must have the same reminder when divided by 7. The remainder is 2.

https://en.wikipedia.org/wiki/Divisibility_rule 8/20
4/17/2019 Divisibility rule - Wikipedia

Therefore, if a number n is a multiple of 7 (i.e.: the remainder of n/7 is 0), then adding (or subtracting) multiples of 7
cannot change that property.

What this procedure does, as explained above for most divisibility rules, is simply subtract little by little multiples of 7
from the original number until reaching a number that is small enough for us to remember whether it is a multiple of
7. If 1 becomes a 3 in the following decimal position, that is just the same as converting 10×10n into a 3×10n. And that
is actually the same as subtracting 7×10n (clearly a multiple of 7) from 10×10n.

Similarly, when you turn a 3 into a 2 in the following decimal position, you are turning 30×10n into 2×10n, which is
the same as subtracting 30×10n−28×10n, and this is again subtracting a multiple of 7. The same reason applies for all
the remaining conversions:

20×10n − 6×10n=14×10n
60×10n − 4×10n=56×10n
40×10n − 5×10n=35×10n
50×10n − 1×10n=49×10n
First method example
1050 → 105 − 0=105 → 10 − 10 = 0. ANSWER: 1050 is divisible by 7.

Second method example

1050 → 0501 (reverse) → 0×1 + 5×3 + 0×2 + 1×6 = 0 + 15 + 0 + 6 = 21 (multiply and add). ANSWER: 1050 is
divisible by 7.

Vedic method of divisibility by osculation

Divisibility by seven can be tested by multiplication by the Ekhādika. Convert the divisor seven to the nines family by
multiplying by seven. 7×7=49. Add one, drop the units digit and, take the 5, the Ekhādika, as the multiplier. Start on
the right. Multiply by 5, add the product to the next digit to the left. Set down that result on a line below that digit.
Repeat that method of multiplying the units digit by five and adding that product to the number of tens. Add the result
to the next digit to the left. Write down that result below the digit. Continue to the end. If the end result is zero or a
multiple of seven, then yes, the number is divisible by seven. Otherwise, it is not. This follows the Vedic ideal, one-line
notation.[10]

Vedic method example:

Is 438,722,025 divisible by seven? Multiplier = 5.

4 3 8 7 2 2 0 2 5
42 37 46 37 6 40 37 27
YES

Pohlman–Mass method of divisibility by 7

The Pohlman–Mass method provides a quick solution that can determine if most integers are divisible by seven in
three steps or less. This method could be useful in a mathematics competition such as MATHCOUNTS, where time is a
factor to determine the solution without a calculator in the Sprint Round.

Step A: If the integer is 1,000 or less, subtract twice the last digit from the number formed by the remaining digits. If
the result is a multiple of seven, then so is the original number (and vice versa). For example:

112 -> 11 − (2×2) = 11 − 4 = 7 YES

98 -> 9 − (8×2) = 9 − 16 = −7 YES
634 -> 63 − (4×2) = 63 − 8 = 55 NO

Because 1,001 is divisible by seven, an interesting pattern develops for repeating sets of 1, 2, or 3 digits that form 6-
digit numbers (leading zeros are allowed) in that all such numbers are divisible by seven. For example:

https://en.wikipedia.org/wiki/Divisibility_rule 9/20
4/17/2019 Divisibility rule - Wikipedia

001 001 = 1,001 / 7 = 143

010 010 = 10,010 / 7 = 1,430
011 011 = 11,011 / 7 = 1,573
100 100 = 100,100 / 7 = 14,300
101 101 = 101,101 / 7 = 14,443
110 110 = 110,110 / 7 = 15,730

01 01 01 = 10,101 / 7 = 1,443
10 10 10 = 101,010 / 7 = 14,430

111,111 / 7 = 15,873
222,222 / 7 = 31,746
999,999 / 7 = 142,857

576,576 / 7 = 82,368

For all of the above examples, subtracting the first three digits from the last three results in a multiple of seven. Notice
that leading zeros are permitted to form a 6-digit pattern.

This phenomenon forms the basis for Steps B and C.

Step B: If the integer is between 1,001 and one million, find a repeating pattern of 1, 2, or 3 digits that forms a 6-digit
number that is close to the integer (leading zeros are allowed and can help you visualize the pattern). If the positive
difference is less than 1,000, apply Step A. This can be done by subtracting the first three digits from the last three
digits. For example:

341,355 − 341,341 = 14 -> 1 − (4×2) = 1 − 8 = −7 YES

67,326 − 067,067 = 259 -> 25 − (9×2) = 25 − 18 = 7 YES

The fact that 999,999 is a multiple of 7 can be used for determining divisibility of integers larger than one million by
reducing the integer to a 6-digit number that can be determined using Step B. This can be done easily by adding the
digits left of the first six to the last six and follow with Step A.

Step C: If the integer is larger than one million, subtract the nearest multiple of 999,999 and then apply Step B. For
even larger numbers, use larger sets such as 12-digits (999,999,999,999) and so on. Then, break the integer into a
smaller number that can be solved using Step B. For example:

22,862,420 − (999,999 × 22) = 22,862,420 − 21,999,978 -> 862,420 + 22 = 862,442

862,442 -> 862 − 442 (Step B) = 420 -> 42 − (0×2) (Step A) = 42 YES

This allows adding and subtracting alternating sets of three digits to determine divisibility by seven. Understanding
these patterns allows you to quickly calculate divisibility of seven as seen in the following examples:

Pohlman–Mass method of divisibility by 7, examples:

Is 98 divisible by seven?
98 -> 9 − (8×2) = 9 − 16 = −7 YES (Step A)

Is 634 divisible by seven?

634 -> 63 − (4×2) = 63 − 8 = 55 NO (Step A)

Is 355,341 divisible by seven?

355,341 − 341,341 = 14,000 (Step B) -> 014 − 000 (Step B) -> 14 = 1 − (4×2) (Step A) = 1 − 8 = −7 YES

https://en.wikipedia.org/wiki/Divisibility_rule 10/20
4/17/2019 Divisibility rule - Wikipedia

Is 42,341,530 divisible by seven?

42,341,530 -> 341,530 + 42 = 341,572 (Step C)
341,572 − 341,341 = 231 (Step B)
231 -> 23 − (1×2) = 23 − 2 = 21 YES (Step A)

Using quick alternating additions and subtractions:

42,341,530 -> 530 − 341 + 42 = 189 + 42 = 231 -> 23 − (1×2) = 21 YES

Multiplication by 3 method of divisibility by 7, examples:

Is 98 divisible by seven?
98 -> 9 remainder 2 -> 2×3 + 8 = 14 YES

Is 634 divisible by seven?

634 -> 6×3 + 3 = 21 -> remainder 0 -> 0×3 + 4 = 4 NO

Is 355,341 divisible by seven?

3 * 3 + 5 = 14 -> remainder 0 -> 0×3 + 5 = 5 -> 5×3 + 3 = 18 -> remainder 4 -> 4×3 + 4 = 16 -> remainder 2 -> 2×3 + 1
= 7 YES

Find remainder of 1036125837 divided by 7

1×3 + 0 = 3
3×3 + 3 = 12 remainder 5
5×3 + 6 = 21 remainder 0
0×3 + 1 = 1
1×3 + 2 = 5
5×3 + 5 = 20 remainder 6
6×3 + 8 = 26 remainder 5
5×3 + 3 = 18 remainder 4
4×3 + 7 = 19 remainder 5
Answer is 5

Finding remainder of a number when divided by 7

7 − (1, 3, 2, −1, −3, −2, cycle repeats for the next six digits) Period: 6 digits. Recurring numbers: 1, 3, 2, −1, −3, −2
Minimum magnitude sequence
(1, 3, 2, 6, 4, 5, cycle repeats for the next six digits) Period: 6 digits. Recurring numbers: 1, 3, 2, 6, 4, 5
Positive sequence

Multiply the right most digit by the left most digit in the sequence and multiply the second right most digit by the
second left most digit in the sequence and so on and so for. Next, compute the sum of all the values and take the
modulus of 7.
Example: What is the remainder when 1036125837 is divided by 7?

Multiplication of the rightmost digit = 1 × 7 = 7

Multiplication of the second rightmost digit = 3 × 3 = 9

Third rightmost digit = 8 × 2 = 16

Fourth rightmost digit = 5 × −1 = −5

Fifth rightmost digit = 2 × −3 = −6

Sixth rightmost digit = 1 × −2 = −2

https://en.wikipedia.org/wiki/Divisibility_rule 11/20
4/17/2019 Divisibility rule - Wikipedia

Seventh rightmost digit = 6 × 1 = 6

Eighth rightmost digit = 3 × 3 = 9

Ninth rightmost digit = 0

Tenth rightmost digit = 1 × −1 = −1

Sum = 33

33 modulus 7 = 5

Remainder = 5

Digit pair method of divisibility by 7

This method uses 1, −3, 2 pattern on the digit pairs. That is, the divisibility of any number by seven can be tested by
first separating the number into digit pairs, and then applying the algorithm on three digit pairs (six digits). When the
number is smaller than six digits, then fill zero’s to the right side until there are six digits. When the number is larger
than six digits, then repeat the cycle on the next six digit group and then add the results. Repeat the algorithm until the
result is a small number. The original number is divisible by seven if and only if the number obtained using this
algorithm is divisible by seven. This method is especially suitable for large numbers.

Example 1:
The number to be tested is 157514. First we separate the number into three digit pairs: 15, 75 and 14.
Then we apply the algorithm: 1 × 15 − 3 × 75 + 2 × 14 = 182
Because the resulting 182 is less than six digits, we add zero’s to the right side until it is six digits.
Then we apply our algorithm again: 1 × 18 − 3 × 20 + 2 × 0 = −42
The result −42 is divisible by seven, thus the original number 157514 is divisible by seven.

Example 2:
The number to be tested is 15751537186.
(1 × 15 − 3 × 75 + 2 × 15) + (1 × 37 − 3 × 18 + 2 × 60) = −180 + 103 = −77
The result −77 is divisible by seven, thus the original number 15751537186 is divisible by seven.

Divisibility by 13
Remainder Test 13 (1, −3, −4, −1, 3, 4, cycle goes on.) If you are not comfortable with negative numbers, then use this
sequence. (1, 10, 9, 12, 3, 4)

Multiply the right most digit of the number with the left most number in the sequence shown above and the second
right most digit to the second left most digit of the number in the sequence. The cycle goes on.

Example: What is the remainder when 321 is divided by 13?

Using the first sequence,
Ans: 1 × 1 + 2 × −3 + 3 × −4 = −17
Remainder = −17 mod 13 = 9

Example: What is the remainder when 1234567 is divided by 13?

Using the second sequence,
Answer: 7 × 1 + 6 × 10 + 5 × 9 + 4 × 12 + 3 × 3 + 2 × 4 + 1 × 1 = 178 mod 13 = 9

https://en.wikipedia.org/wiki/Divisibility_rule 12/20
4/17/2019 Divisibility rule - Wikipedia

Remainder = 9

Beyond 30
Divisibility properties can be determined in two ways, depending on the type of the divisor.

Composite divisors
A number is divisible by a given divisor if it is divisible by the highest power of each of its prime factors. For example,
to determine divisibility by 36, check divisibility by 4 and by 9.[6] Note that checking 3 and 12, or 2 and 18, would not
be sufficient. A table of prime factors may be useful.

A composite divisor may also have a rule formed using the same procedure as for a prime divisor, given below, with
the caveat that the manipulations involved may not introduce any factor which is present in the divisor. For instance,
one cannot make a rule for 14 that involves multiplying the equation by 7. This is not an issue for prime divisors
because they have no smaller factors.

Prime divisors
The goal is to find an inverse to 10 modulo the prime under consideration (does not work for 2 or 5) and use that as a
multiplier to make the divisibility of the original number by that prime depend on the divisibility of the new (usually
smaller) number by the same prime. Using 31 as an example, since 10 × (−3) = −30 = 1 mod 31, we get the rule for
using y − 3x in the table above. Likewise, since 10 × (28) = 280 = 1 mod 31 also, we obtain a complementary rule
y + 28x of the same kind - our choice of addition or subtraction being dictated by arithmetic convenience of the
smaller value. In fact, this rule for prime divisors besides 2 and 5 is really a rule for divisibility by any integer relatively
prime to 10 (including 33 and 39; see the table below). This is why the last divisibility condition in the tables above
and below for any number relatively prime to 10 has the same kind of form (add or subtract some multiple of the last
digit from the rest of the number).

Notable examples
The following table provides rules for some more notable divisors:

https://en.wikipedia.org/wiki/Divisibility_rule 13/20
4/17/2019 Divisibility rule - Wikipedia

Divisor Divisibility condition Examples

31 Subtract three times the last digit from the rest. 837: 83 − 3×7 = 62
The number formed by the last five digits is divisible by
25,135,520: 35,520=1110×32
32.[2][3]
If the ten thousands digit is even, examine the number
41,312: 1312.
32 formed by the last four digits.
If the ten thousands digit is odd, examine the number
254,176: 4176+16 = 4192.
formed by the last four digits plus 16.
Add the last two digits to 4 times the rest. 1312: (13×4) + 12 = 64.
627: 62 + 10×7 = 132,
Add 10 times the last digit to the rest.
33 13 + 10×2 = 33.
Add the digits in blocks of two from right to left. 2145: 21 + 45 = 66.
35 Number must be divisible by 7 ending in 0 or 5.
Take the digits in blocks of three from right to left and 2,651,272: 2 + 651 + 272 = 925. 925 =
37 add each block. 37×25.
Subtract 11 times the last digit from the rest. 925: 92 − (5×11) = 37.
39 Add 4 times the last digit to the rest. 351: 35 + (1 × 4) = 39
72,841,536,727: 7 + 28,415 + 36,727 =
Sum the digits in blocks of five from right to left.
41 65,149 = 41×1,589.
Subtract 4 times the last digit from the rest. 738: 73 − 8 × 4 = 41.
36,249: 3624 + 9 × 13 = 3741,
374 + 1 × 13 = 387,
Add 13 times the last digit to the rest.
43 38 + 7 × 13 = 129,
12 + 9 × 13 = 129 = 43 × 3.
Subtract 3 times the last two digits from the rest. 36,249: 362 - 49 × 3 = 215 = 43 × 5.

45 The number must be divisible by 9 ending in 0 or 5.[6] 2025: Ends in 5 and 2+0+2+5=9.

1,642,979: 164297 − 9 × 14 = 164171,

16417 − 14 = 16403,
Subtract 14 times the last digit from the rest.
47 1640 − 3 × 14 = 1598,
159 − 8 × 14 = 47.
Add the last two digits to 6 times the rest. 705: 7 × 6 + 5 = 47.
1,127: 112+(7×5)=147.
Add 5 times the last digit to the rest.
49 147: 14 + (7×5) = 49
Add the last two digits to 2 times the rest. 588: 5 × 2 + 88 = 98.
50 The last two digits are 00 or 50. 134,250: 50.
Subtract 5 times the last digit to the rest. 204: 20-(4×5)=0
51
Subtract the last two digits from 2 times the rest. 459: 4 × 2 - 59 = -51.
Add 16 times the last digit to the rest. 3657: 365+(7×16)=477 = 9 × 53
53
Subtract the last two digits from 6 times the rest. 5777: 57 × 6 - 77 = 265.

55 Number must be divisible by 11 ending in 0 or 5.[6]

59 Add 6 times the last digit to the rest. 295: 29 + 5×6= 59
61 Subtract 6 times the last digit from the rest. 732: 73-(2×6)=61
The number formed by the last six digits must be
64 2,640,000 is divisible by 64.
divisible by 64.[2][3]

65 Number must be divisible by 13 ending in 0 or 5.[6]

67 Subtract twice the last two digits from the rest. 9112: 91 - 12×2= 67
https://en.wikipedia.org/wiki/Divisibility_rule 14/20
4/17/2019 Divisibility rule - Wikipedia

Subtract 20 times the last digit from the rest. 4489: 448-9×20=448-180=268.
69 Add 7 times the last digit to the rest. 345: 34 + 5×7 = 69
71 Subtract 7 times the last digit from the rest. 852: 85-(2×7)=71
Form the alternating sum of blocks of four from right to
73 220,241: 241 - 22 = 219.
left.
Number must be divisible by 3 ending in 00, 25, 50 or
75
75.[6]
Form the alternating sum of blocks of three from right to
77 76,923: 923 - 76 = 847.
left.
79 Add 8 times the last digit to the rest. 711: 71 + 1×8= 79
81 Subtract 8 times the last digit from the rest. 162: 16-(2×8)=0
Add 25 times the last digit to the rest. 581: 58+(1×25)=83
83
Add the last three digits to four times the rest. 38,014: (4×38) + 14 = 166
30,855: 3085 - 25 = 3060 = 17×18. And the
85 Number must be divisible by 17 ending in 0 or 5.
number ends in 5.
Add 9 times the last digit to the rest. 801: 80 + 1×9 = 89
89
Add the last two digits to eleven times the rest. 712: 12 + (7×11) = 89
Subtract 9 times the last digit from the rest. 182: 18 - (2×9) = 0
Form the alternating sum of blocks of three from right to
5,274,997: 5 - 274 + 997 = 728
left.
91
8281: 828+4 = 832. 83+8=91
Number is divisible by 7 and 13. 828-2=826. 82-12=70.

51,585: 5158 + 10 = 5168,

516 + 16 = 532,
95 Number must be divisible by 19 ending in 0 or 5.
53 + 4 = 57 = 19×3. And the number ends in
5.
Subtract 29 times the last digit from the rest. 291: 29 - (1×29) = 0
97
Add the last two digits to 3 times the rest. 485: (3×4)+ 85 = 97
99 Add the digits in blocks of two from right to left. 144,837: 14 + 48 + 37 = 99.
100 Ends with at least two zeros. 14100: It has two zeros at the end.
Form the alternating sum of blocks of two from right to
101 40,299: 4 - 2 + 99 = 101.
left.
585658: 58565 + (8×31) = 58813. 58813 :
Add 31 times the last digit to the rest.
103 103 = 571
Subtract the last two digits from 3 times the rest. 5356: (53×3) - 56 = 103
Subtract 32 times the last digit from the rest. 428: 42 - (8×32) = -214
107
Subtract the last two digits from 7 times the rest. 1712: 17 × 7 - 12 = 107
109 Add 11 times the last digit to the rest. 654: 65 + (11×4) = 109
111 Add the digits in blocks of three from right to left. 1,370,184: 1 + 370 + 184 = 555
121 Subtract 12 times the last digit from the rest. 847: 84 - 12 × 7 = 0
The number formed by the last three digits must be
125 2125 is divisible by 125.
divisible by 125.[3]
The number formed by the last seven digits must be
128 11,280,000 is divisible by 128.
divisible by 128.[2][3]

https://en.wikipedia.org/wiki/Divisibility_rule 15/20
4/17/2019 Divisibility rule - Wikipedia

137 Form the alternating sum of blocks of four from right to 340,171: 171 - 34 = 137.
left.
Form the alternating sum of blocks of three from right to
143 1,774,487: 1 - 774 + 487 = -286
left.
163 Add 49 times the last digit to the rest. 26569: 2656 + 441 = 3097 = 163×19.
Last two digits of the number are "00", "25", "50", or 15,075: 75 is at the end and 1 + 5 + 0 + 7 + 5
225
"75" and the sum of the digits is a multiple of 9. = 18 = 2×9.
Take the digits in blocks of seven from right to left and
239 1,560,000,083: 156 + 83 = 239.
add each block.
The number formed by the last eight digits must be
256 225,600,000 is divisible by 256.
divisible by 256.[2][3]
651249: 65124+243=65367.
269 Add 27 times the last digit to the rest.
6536+189=6725. 6725=269×25.
Take the digits in blocks of five from right to left and add 77,925,613,961: 7 + 79,256 + 13,961 =
each block. 93,224 = 271×344.
271
93,224: 9,322 - 4 × 27 = 9,214,
Subtract 27 times the last digit from the rest.
921 - 4 × 27 = 813 = 271 × 3.
329 Add 33 times the last digit to the rest. 9541:954+1×33=954+33=987. 987=3×329.
331 Subtract 33 times the last digit from the rest. 22177: 2217-231=1986. 1986=6×331.
333 Add the digits in blocks of three from right to left. 410,922: 410 + 922 = 1,332
Take the digits in blocks of five from right to left and add 50243409: 43409+502=43911.
369 each block. 43911=369×119.
Add 37 times the last digit to the rest. 8487: 848+7×37=848+259=1107.
The number formed by the last 3 digits must be
140,625: 625 = 125×5 and 1 + 4 + 0 + 6 + 2 +
375 divisible by 125 and the sum of all digits is a multiple of
5 = 18 = 6×3.
3.
499 Add the last three digits to two times the rest. 74,351: 74 × 2 + 351 = 499.
500 Ends with 000 or 500. 47,500 is divisible by 500.
The number formed by the last nine digits must be
512 1,512,000,000 is divisible by 512.
divisible by 512.[2][3]
Ends in 0000, 0625, 1250, 1875, 2500, 3125, 3750,
4375, 5000, 5625, 6250, 6875, 7500, 8125, 8750 or
9375.
625 567,886,875: 6875.
Or, the number formed by the last four digits is divisible
by 625.

983 Add the last three digits to seventeen times the rest. 64878: 64×17+878=1966. 1966=2×983
Add the last three digits to thirteen times the rest. 30597: 30×13+597=987
547785: 5+4+7+7+8+5=36. 36=3×12
987 Number must be divisible by 329 with the sum of all 54778+5×33=54943. 5494+3×33=5593.
digits being divisible by 3.
559+3×33=658. 658=2×329.

Add the last three digits to eleven times the rest. 21758: 21 × 11 = 231; 758 + 231 = 989

989 1978: 197+56=253. 253=11×23

Number must be divisible by 23 and 43. 197+104=301. 301=7×43.

993 Add the last three digits to seven times the rest. 986049: 49+6902=6951. 6951=7×993.
Number must be divisible by 331 with the sum of all 8937: 8+7=15. 15=3×5. (Note: 9 and 3 don't
https://en.wikipedia.org/wiki/Divisibility_rule 16/20
4/17/2019 Divisibility rule - Wikipedia

digits being divisible by 3. have to be in the sum, they are divisible by

3.)
893-231=662. 662=2×331.
997 Add the last three digits to three times the rest. 157,526: 157 × 3 + 526= 997
999 Add the digits in blocks of three from right to left. 235,764: 235 + 764 = 999
1000 Ends with at least three zeros. 2000 ends with 3 zeros

Generalized divisibility rule

To test for divisibility by D, where D ends in 1, 3, 7, or 9, the following method can be used.[11] Find any multiple of D
ending in 9. (If D ends respectively in 1, 3, 7, or 9, then multiply by 9, 3, 7, or 1.) Then add 1 and divide by 10, denoting
the result as m. Then a number N = 10t + q is divisible by D if and only if mq + t is divisible by D. If the number is too
large, you can also break it down into several strings with e digits each, satisfying either 10e = 1 or 10e = -1 (mod D).
The sum (or alternate sum) of the numbers have the same divisibility as the original one.

For example, to determine if 913 = 10×91 + 3 is divisible by 11, find that m = (11×9+1)÷10 = 10. Then mq+t = 10×3+91
= 121; this is divisible by 11 (with quotient 11), so 913 is also divisible by 11. As another example, to determine if 689 =
10×68 + 9 is divisible by 53, find that m = (53×3+1)÷10 = 16. Then mq+t = 16×9 + 68 = 212, which is divisible by 53
(with quotient 4); so 689 is also divisible by 53.

Proofs

Proof using basic algebra

Many of the simpler rules can be produced using only algebraic manipulation, creating binomials and rearranging
them. By writing a number as the sum of each digit times a power of 10 each digit's power can be manipulated
individually.

Case where all digits are summed

This method works for divisors that are factors of 10 − 1 = 9.

Using 3 as an example, 3 divides 9 = 10 − 1. That means (see modular arithmetic). The same for all
the higher powers of 10: They are all congruent to 1 modulo 3. Since two things that are
congruent modulo 3 are either both divisible by 3 or both not, we can interchange values that are congruent modulo 3.
So, in a number such as the following, we can replace all the powers of 10 by 1:

which is exactly the sum of the digits.

Case where the alternating sum of digits is used

This method works for divisors that are factors of 10 + 1 = 11.

Using 11 as an example, 11 divides 11 = 10 + 1. That means . For the higher powers of 10, they are
congruent to 1 for even powers and congruent to −1 for odd powers:

Like the previous case, we can substitute powers of 10 with congruent values:

https://en.wikipedia.org/wiki/Divisibility_rule 17/20
4/17/2019 Divisibility rule - Wikipedia

which is also the difference between the sum of digits at odd positions and the sum of digits at even positions.

Case where only the last digit(s) matter

This applies to divisors that are a factor of a power of 10. This is because sufficiently high powers of the base are
multiples of the divisor, and can be eliminated.

For example, in base 10, the factors of 101 include 2, 5, and 10. Therefore, divisibility by 2, 5, and 10 only depend on
whether the last 1 digit is divisible by those divisors. The factors of 102 include 4 and 25, and divisibility by those only
depend on the last 2 digits.

Case where only the last digit(s) are removed

Most numbers do not divide 9 or 10 evenly, but do divide a higher power of 10n or 10n − 1. In this case the number is
still written in powers of 10, but not fully expanded.

For example, 7 does not divide 9 or 10, but does divide 98, which is close to 100. Thus, proceed from

where in this case a is any integer, and b can range from 0 to 99. Next,

and again expanding

and after eliminating the known multiple of 7, the result is

which is the rule "double the number formed by all but the last two digits, then add the last two digits".

Case where the last digit(s) is multiplied by a factor

The representation of the number may also be multiplied by any number relatively prime to the divisor without
changing its divisibility. After observing that 7 divides 21, we can perform the following:

after multiplying by 2, this becomes

and then

Eliminating the 21 gives

and multiplying by −1 gives

https://en.wikipedia.org/wiki/Divisibility_rule 18/20
4/17/2019 Divisibility rule - Wikipedia

Either of the last two rules may be used, depending on which is easier to perform. They correspond to the rule
"subtract twice the last digit from the rest".

Proof using modular arithmetic

This section will illustrate the basic method; all the rules can be derived following the same procedure. The following
requires a basic grounding in modular arithmetic; for divisibility other than by 2's and 5's the proofs rest on the basic
fact that 10 mod m is invertible if 10 and m are relatively prime.

For 2n or 5n:

Only the last n digits need to be checked.

Representing x as

and the divisibility of x is the same as that of z.

For 7:

Since 10 × 5 ≡ 10 × (−2) ≡ 1 (mod 7) we can do the following:

Representing x as

so x is divisible by 7 if and only if y − 2z is divisible by 7.

See also
Parity (mathematics)

References
1. Gardner, Martin (September 1962). "Mathematical Games: Tests that show whether a large number can be
divided by a number from 2 to 12". Scientific American. 207 (3): 232–246. doi:10.1038/scientificamerican0962-
232 (https://doi.org/10.1038%2Fscientificamerican0962-232). JSTOR 24936675 (https://www.jstor.org/stable/2493
6675).
2. This follows from Pascal's criterion. See Kisačanin (1998), p. 100–101 (https://books.google.com/books?id=BFtO
uh5xGOwC&pg=PA101&dq=%22A+number+is+divisible+by%22)
3. A number is divisible by 2m, 5m or 10m if and only if the number formed by the last m digits is divisible by that
number. See Richmond & Richmond (2009), p. 105 (https://books.google.com/books?id=HucyKYx0_WwC&pg=P
A105&dq=%22formed+by+the+last%22)
4. Apostol (1976), p. 108 (https://books.google.com/books?id=Il64dZELHEIC&pg=PA108&dq=%22sum+of+its+digit
s%22)
5. Richmond & Richmond (2009), Section 3.4 (Divisibility Tests), p. 102–108 (https://books.google.com/books?id=Hu
cyKYx0_WwC&pg=PA102&dq=%22divisible+by%22)
6. Richmond & Richmond (2009), Section 3.4 (Divisibility Tests), Theorem 3.4.3, p. 107 (https://books.google.com/b
ooks?id=HucyKYx0_WwC&pg=PA102&dq=%22divisible+by+the+product%22)
https://en.wikipedia.org/wiki/Divisibility_rule 19/20
4/17/2019 Divisibility rule - Wikipedia

7. Kisačanin (1998), p. 101 (https://books.google.com/books?id=BFtOuh5xGOwC&pg=PA101&dq=%22third+criterio

n+for+11%22)
8. Janet Epebinu,http://janetbmath.com
9. Su, Francis E. " "Divisibility by Seven" Mudd Math Fun Facts" (http://www.math.hmc.edu/funfacts/ffiles/10005.5.sh
tml). Retrieved 2006-12-12.
10. Page 274, Vedic Mathematics: Sixteen Simple Mathematical Formulae, by Swami Sankaracarya, published
by Motilal Banarsidass, Varanasi, India, 1965, Delhi, 1978. 367 pages.
11. Dunkels, Andrejs, "Comments on note 82.53—a generalized test for divisibility", Mathematical Gazette 84, March
2000, 79-81.

Sources
Apostol, Tom M. (1976). Introduction to analytic number theory. Undergraduate Texts in Mathematics. 1. Springer-
Verlag. ISBN 978-0-387-90163-3.
Kisačanin, Branislav (1998). Mathematical problems and proofs: combinatorics, number theory, and geometry.
Plenum Press. ISBN 978-0-306-45967-2.
Richmond, Bettina; Richmond, Thomas (2009). A Discrete Transition to Advanced Mathematics. Pure and Applied
Undergraduate Texts. 3. American Mathematical Soc. ISBN 978-0-8218-4789-3.

External links
Divisibility Criteria (http://www.cut-the-knot.org/blue/divisibility.shtml) at cut-the-knot
Stupid Divisibility Tricks (https://webspace.ship.edu/msrenault/divisibility/index.htm) Divisibility rules for 2–100.

Retrieved from "https://en.wikipedia.org/w/index.php?title=Divisibility_rule&oldid=886392868"

This page was last edited on 6 March 2019, at 00:31 (UTC).

Text is available under the Creative Commons Attribution-ShareAlike License; additional terms may apply. By using
this site, you agree to the Terms of Use and Privacy Policy. Wikipedia® is a registered trademark of the Wikimedia
Foundation, Inc., a non-profit organization.

https://en.wikipedia.org/wiki/Divisibility_rule 20/20