ExamShortcut
high importance~2 Q in Tier 135 formulas⚡ 18 shortcuts6 subtopics
All subtopics·Subtopic 2 of 6

Divisibility rules

🔒 Log in to track
⏱ 5 min read🧩 7 question types🎯 18 practice Q
The idea in one minute

A number is divisible by d when d divides it with remainder 0. Quick tests exist for 2, 3, 4, 5, 8, 9, 10 and 11, and composite divisors split into co-prime parts. Powers follow their own rules: a to the n minus b to the n is always divisible by a minus b.

01

Overview

A number NN is divisible by dd when dd divides NN exactly, leaving remainder 00. Divisibility tests let you check this without long division. This lesson covers the basic tests, composite divisors, missing digits, power rules, and reaching the nearest multiple.

02

The quick tests

DivisorTestExample
2,5,102, 5, 10last digit even, 00 or 55, 004,2154,215 by 55
44last two digits divisible by 447,316→167,316 \to 16
88last three digits divisible by 8891,224→22491,224 \to 224
3,93, 9digit sum divisible by 33 or 996,453→186,453 \to 18
1111odd-place sum minus even-place sum is 00 or a multiple of 1111see below
7,11,137, 11, 13alternating sum of three-digit blocks276,276→276−276=0276,276 \to 276 - 276 = 0

Rule: For 1111, number the digits from the right. Take (odd-place sum) −- (even-place sum). For 948475948475: odd places 5+4+4=135 + 4 + 4 = 13, even places 7+8+9=247 + 8 + 9 = 24, and 24−13=1124 - 13 = 11, so it is divisible by 1111.

03

Composite divisors split into co-prime parts

There is no direct rule of 7272. Split the divisor into parts that share no factor, then check each part. Useful splits: 12=3×412 = 3 \times 4, 24=3×824 = 3 \times 8, 36=4×936 = 4 \times 9, 72=8×972 = 8 \times 9, 88=8×1188 = 8 \times 11, 99=9×1199 = 9 \times 11.

Watch: Never split 2424 as 4×64 \times 6. They share the factor 22: the number 3636 passes both tests yet leaves remainder 1212 with 2424.

04

Missing digit questions

When digits are hidden as xx and yy, use the rule with the fewest choices first. The rule of 88 pins the last three digits. The rule of 1111 gives one equation, the digit sum for 99 gives another. Several pairs may work, but the asked quantity, usually x+yx + y, stays the same in every valid pair.

05

Divisibility of powers

Three rules cover almost every power question:

  • an−bna^n - b^n is divisible by a−ba - b for every nn.
  • an−bna^n - b^n is divisible by a+ba + b when nn is even.
  • an+bna^n + b^n is divisible by a+ba + b when nn is odd.

So 2918−151829^{18} - 15^{18} is divisible by both 29−15=1429 - 15 = 14 and 29+15=4429 + 15 = 44, and 1725+232517^{25} + 23^{25} is divisible by 4040 because 2525 is odd.

For sums of powers of one base, pull out the smallest power: 325+326+327=325(1+3+9)=325×133^{25} + 3^{26} + 3^{27} = 3^{25}(1 + 3 + 9) = 3^{25} \times 13.

06

Special digit patterns

  • A six-digit number written as a repeated three-digit block, like 276276276276, equals abc‾×1001\overline{abc} \times 1001, and 1001=7×11×131001 = 7 \times 11 \times 13.
  • A three-digit number with equal digits, like 777=7×111777 = 7 \times 111, is divisible by 3737.
  • A two-digit number plus its reverse equals 11(a+b)11(a + b); the difference is 9(a−b)9(a - b).
  • The product of three consecutive integers is divisible by 66.
07

Divisibility by seven

Cut the last digit, double it, and subtract from what remains. Repeat until the number is small. If the result is divisible by 77, so was the original: 3598→359−16=343=7×493598 \to 359 - 16 = 343 = 7 \times 49.

08

Reaching the nearest multiple

To make NN divisible by dd, divide and find the remainder rr. Subtract rr to go down to the lower multiple, or add d−rd - r to go up. For 8357÷128357 \div 12 the remainder is 55, so adding 77 gives 8364=12×6978364 = 12 \times 697.

Example: Largest four-digit multiple of a divisor: take 99999999, divide, and subtract the remainder from 99999999.

09

Question types you will see

Each type: how to recognise it, the method step by step, and one question to try.

Type 1very common3 practice Q

Missing digits for a composite divisor

How to spot it:

A number with blanks x and y is said to be divisible by 72, 88, 99 or 36, and the options are values of x + y or x - y.

72=8×9,88=8×11,99=9×1172 = 8 \times 9,\quad 88 = 8 \times 11,\quad 99 = 9 \times 11
Method
  1. Split the divisor into co-prime factors.

  2. Apply the rule with fewer choices first: 88 fixes the last three digits, 1111 gives one equation.

  3. Feed that result into the second rule, the digit sum for 99 or the alternating sum for 1111.

  4. List the working pairs; the asked sum or difference is the same in all of them.

Why it works:

A number divisible by two co-prime numbers is divisible by their product, and each rule cuts the possibilities.

Try this

If the five-digit number 6x8y4 is divisible by 72, find x + y.

Show solution
  1. 72=8×972 = 8 \times 9. Rule of 88: the last three digits 8y48y4 must divide by 88.

  2. 824=8×103824 = 8 \times 103 and 864=8×108864 = 8 \times 108, so y=2y = 2 or y=6y = 6.

  3. Rule of 99: digit sum 6+x+8+y+4=18+x+y6 + x + 8 + y + 4 = 18 + x + y must divide by 99.

  4. y=2y = 2 forces x=7x = 7; y=6y = 6 forces x=3x = 3. Both give x+y=9x + y = 9.

Answer

9

Type 2very common2 practice Q

Divisibility by 11 with a missing digit

How to spot it:

A number like 7x2859 is divisible by 11 and one digit is hidden, or the options are numbers to pick from.

(odd-place sum)−(even-place sum)∈{0,±11,±22,…}(\text{odd-place sum}) - (\text{even-place sum}) \in \{0, \pm 11, \pm 22, \ldots\}
Method
  1. Number the digits from the right and add the odd places and the even places separately.

  2. Subtract the two sums; the result must be 00 or a multiple of 1111.

  3. Solve for the missing digit, which must stay between 00 and 99.

Why it works:

Ten leaves remainder minus one with eleven, so place values flip between plus and minus.

Try this

If the number 7x2859 is divisible by 11, find x.

Show solution
  1. From the right, odd places: 9+8+x=17+x9 + 8 + x = 17 + x. Even places: 5+2+7=145 + 2 + 7 = 14.

  2. Difference: (17+x)−14=3+x(17 + x) - 14 = 3 + x must be 00 or 1111.

  3. 3+x=113 + x = 11 gives x=8x = 8. Check: 782859=11×71169782859 = 11 \times 71169.

Answer

8

Type 3very common3 practice Q

Divisibility of a power of the form a to the n minus b to the n

How to spot it:

Two big powers with the same exponent, added or subtracted, and the question asks which listed number divides them.

(a−b)∣(an−bn);(a+b)∣(an−bn) for even n;(a+b)∣(an+bn) for odd n(a - b) \mid (a^n - b^n);\quad (a + b) \mid (a^n - b^n) \text{ for even } n;\quad (a + b) \mid (a^n + b^n) \text{ for odd } n
Method
  1. Note whether the powers are added or subtracted, and whether nn is even or odd.

  2. Compute a−ba - b and a+ba + b.

  3. Match against the options: the difference always works; the sum needs the right parity of nn.

Why it works:

Factoring a to the n minus b to the n exposes both a minus b and, for even n, a plus b.

Try this

29 to the power 18 minus 15 to the power 18 is divisible by which of 14 and 44?

Show solution
  1. n=18n = 18 is even.

  2. Divisible by a−b=14a - b = 14 always, and by a+b=44a + b = 44 because nn is even.

  3. So both divide it.

Answer

Both 14 and 44

Type 4common2 practice Q

Sum of powers of the same base

How to spot it:

A sum like 3 to the 25 plus 3 to the 26 plus 3 to the 27 appears and the question asks what divides it.

am+am+1+am+2=am(1+a+a2)a^m + a^{m+1} + a^{m+2} = a^m(1 + a + a^2)
Method
  1. Take the smallest power common to every term outside a bracket.

  2. Add the powers inside the bracket to get one small number.

  3. The bracket value divides the whole sum.

Why it works:

Every term shares the smallest power, and the bracket becomes a plain number.

Try this

Find a number other than a power of 3 that divides 3 to the power 15 plus 3 to the power 16 plus 3 to the power 17.

Show solution
  1. Factor: 315(1+3+9)3^{15}(1 + 3 + 9).

  2. 1+3+9=131 + 3 + 9 = 13.

  3. So the sum equals 315×133^{15} \times 13 and is divisible by 1313.

Answer

13

Type 5very common3 practice Q

Least number to add or subtract to reach a multiple

How to spot it:

The question asks what least number must be added to or subtracted from N so the result is divisible by d, or for the largest n-digit multiple.

add=d−(N mod d),subtract=N mod d\text{add} = d - (N \bmod d), \quad \text{subtract} = N \bmod d
Method
  1. Divide NN by dd and note the remainder rr.

  2. To go down to the lower multiple, subtract rr.

  3. To go up to the next multiple, add d−rd - r.

  4. For the largest n-digit multiple, divide a string of nines and subtract its remainder.

Why it works:

Multiples of d sit d apart, and the remainder measures the distance to the lower one.

Try this

What least number must be added to 3286 to make it divisible by 29?

Show solution
  1. 3286=29×113+93286 = 29 \times 113 + 9, so the remainder is 99.

  2. Add 29−9=2029 - 9 = 20.

  3. Check: 3306=29×1143306 = 29 \times 114.

Answer

20

Type 6common2 practice Q

Special forms: repeated blocks and equal digits

How to spot it:

A six-digit number repeats a three-digit block, or a three-digit number has equal digits, and the question asks what always divides it.

abcabc‾=abc‾×7×11×13,aaa‾=a×3×37\overline{abcabc} = \overline{abc} \times 7 \times 11 \times 13, \qquad \overline{aaa} = a \times 3 \times 37
Method
  1. Write the number as its block times a fixed multiplier.

  2. Factor the multiplier: 1001=7×11×131001 = 7 \times 11 \times 13 and 111=3×37111 = 3 \times 37.

  3. Pick the option that divides the fixed multiplier.

Why it works:

The digit pattern builds a fixed multiplier no matter which digits are used.

Try this

Which of 7, 11 and 13 divide 276276?

Show solution
  1. 276276=276×1001276276 = 276 \times 1001.

  2. 1001=7×11×131001 = 7 \times 11 \times 13.

  3. All three divide it.

Answer

All of 7, 11 and 13

Type 7occasional

Divisibility by seven

How to spot it:

The divisor 7 appears with a three- or four-digit number, often in an options question asking which numbers divide it.

N→⌊N10⌋−2×(N mod 10)N \to \left\lfloor \dfrac{N}{10} \right\rfloor - 2 \times (N \bmod 10)
Method
  1. Cut the last digit and double it.

  2. Subtract that from the remaining front part.

  3. Repeat until the number has two or three digits.

  4. If the result is divisible by 77, the original number is too.

Why it works:

Removing the last digit maps N to a smaller number with the same remainder apart from a factor, so divisibility survives.

Try this

Is 3598 divisible by 7?

Show solution
  1. Cut 88, double it: 359−16=343359 - 16 = 343.

  2. 343=7×49343 = 7 \times 49.

  3. Yes, divisible by 77.

Answer

Yes, since 343 = 7 x 49

10

Formula sheet

Divisibility by 11
(∑odd-place digits)−(∑even-place digits)∈{0,±11,±22,…}\left(\sum \text{odd-place digits}\right) - \left(\sum \text{even-place digits}\right) \in \{0, \pm 11, \pm 22, \ldots\}
Composite divisor
pq∣N  ⟺  p∣N and q∣N,gcd⁡(p,q)=1pq \mid N \iff p \mid N \text{ and } q \mid N, \quad \gcd(p, q) = 1

split into co-prime parts only

Difference of powers
(a−b)∣(an−bn) for all n(a - b) \mid (a^n - b^n) \text{ for all } n
Difference of even powers
(a+b)∣(an−bn) when n is even(a + b) \mid (a^n - b^n) \text{ when } n \text{ is even}
Sum of odd powers
(a+b)∣(an+bn) when n is odd(a + b) \mid (a^n + b^n) \text{ when } n \text{ is odd}
Repeated block
abcabc‾=abc‾×1001=abc‾×7×11×13\overline{abcabc} = \overline{abc} \times 1001 = \overline{abc} \times 7 \times 11 \times 13
Divisibility by seven
N→⌊N10⌋−2×(N mod 10)N \to \left\lfloor \dfrac{N}{10} \right\rfloor - 2 \times (N \bmod 10)

repeat until small

11

Shortcuts that save time

⚡ Split into co-prime factors

Break the divisor into parts with no common factor and test each part separately. Order the tests from the most restrictive first.

Example

If the five-digit number 37x84 is divisible by 12, find the smallest value of x.

Show solution
  1. 12=3×412 = 3 \times 4. By 44: last two digits 8484 already pass, for any xx.

  2. By 33: digit sum 3+7+x+8+4=22+x3 + 7 + x + 8 + 4 = 22 + x must be a multiple of 33.

  3. So x∈{2,5,8}x \in \{2, 5, 8\} and the smallest is 22.

Answer

2

⚡ The repeated-block family

Any six-digit number abcabc equals abc times 1001, so it is always divisible by 7, 11 and 13.

Example

Which of 7, 11 and 13 divide 484484?

Show solution
  1. 484484=484×1001484484 = 484 \times 1001.

  2. 1001=7×11×131001 = 7 \times 11 \times 13.

  3. All three divide it.

Answer

All of 7, 11 and 13

⚡ Sum of odd powers

For a to the n plus b to the n with odd n, check the options against a plus b first. No expansion is ever needed.

Example

Is 17 to the power 25 plus 23 to the power 25 divisible by 40?

Show solution
  1. The exponent 2525 is odd, so an+bna^n + b^n is divisible by a+ba + b.

  2. 17+23=4017 + 23 = 40.

  3. Yes, exactly divisible by 4040.

Answer

Yes

12

Mistakes to avoid

Where most students lose marks on this subtopic.

Mistake 01

Splitting a composite divisor into parts that share a factor, like 12 = 2 x 6.

Use co-prime parts only: 12 = 3 x 4. A number can pass 2 and 6 yet fail 12.

Mistake 02

Checking only the last two digits for divisibility by 8.

The rule of 8 needs the last three digits.

Mistake 03

For 11, forgetting that the difference of the two sums can be 0 or negative.

Accept 0, 11, 22 and also -11 as valid differences.

Mistake 04

Using the (a + b) rule for a to the n plus b to the n when n is even.

That rule needs odd n. For even n only a minus b divides the difference.

Mistake 05

Multiplying the two rules' answers instead of checking both divisibilities.

For 72 = 8 x 9 the number must pass both tests; nothing is multiplied.

13

Quick revision

Read this the night before the exam.

  • Last digit tests 2,5,102, 5, 10; last two digits for 44; last three for 88.

  • Digit sum tests 33 and 99; alternating sums test 1111.

  • Composite divisor: split into co-prime parts and test each part.

  • (a−b)(a-b) always divides an−bna^n - b^n; (a+b)(a+b) divides it when nn is even; (a+b)(a+b) divides an+bna^n + b^n when nn is odd.

  • abcabc‾=abc‾×7×11×13\overline{abcabc} = \overline{abc} \times 7 \times 11 \times 13.

  • To reach a multiple: add d−rd - r or subtract rr.

14

Practice: 18 questions

Sets of 10, mixed across the question types above. Every answer has a step-by-step explanation.

Topic test · 10 questions

Suggested time 9 min · wrong answers go to your mistake notebook automatically.