Free Mathematics Class 8 ICSE notes · practise this chapter with an AI quiz

← All study notes

Only the Last Three Digits Decide Divisibility by Eight

Learn every divisibility test from 2 to 11 and when to use each, find the missing digit that makes a number divisible by a given number, and see why each test works using place value.

Why do you only need the last three digits to test for eight?

Because ** is itself divisible by **, so everything above the hundreds place divides cleanly no matter what it is.

Take . Split it as . The is , and since divides it divides — for any thousands digit. So the whole number is divisible by exactly when the leftover is, and settles it.

Every divisibility test in this chapter works the same way: find what the place values give you for free, and the test is whatever is left over. This page covers the second part of the ICSE Class 8 Mathematics chapter on playing with numbers.

What are the divisibility tests from two to eleven?

Nine tests, and each looks at a different feature of the number.

- **By — the units digit** is , , , or .
- **By — the sum of the digits** is divisible by .
- **By — the number formed by the last two digits** is divisible by .
- **By — the units digit** is or .
- **By — the number is divisible by both and .
-
By — the number formed by the last three digits** is divisible by .
- **By — the sum of the digits** is divisible by .
- **By — the units digit** is .
- **By — the difference between the sum of the digits in the odd places and the sum in the even places** is or a multiple of .

Worked example 1 — testing one number against several divisors. Test .

- Digit sum: . Since is divisible by both and , the number is divisible by ** and by .
-
Units digit** is , so it is divisible by ****.
- Divisible by and , so it is divisible by **.
-
Last two digits** are , and , so it is not divisible by .

Checking the claims: and , both exact.

Worked example 2 — by eight. Test . The last three digits are , and , so is divisible by . Checking: .

Worked example 3 — by eleven. Test .

Counting places from the right, the digits are , , , , .







Since is a multiple of , the number is divisible by . Checking: .

**Why the test for needs both parts.** A number divisible by need not be divisible by , and neither need one divisible by and show each case. Only both together work, and the reason is that with and having no common factor.

A warning about combining tests this way. The same trick does not work for every composite number. A number divisible by and by is not necessarily divisible by is divisible by both and not by — because and share a factor. So can be split and cannot.

How do you find a missing digit from a divisibility condition?

Apply the relevant test with the missing digit as a letter, then solve for the digit.

**Worked example 1 — divisible by .** Find the least value of so that is divisible by .

Divisibility by needs both and .

- **By **: the units digit is , which is even, so this holds whatever is.
- **By **: the digit sum is , which must be a multiple of . So , giving , or .

The least value is , giving . Checking: . Correct.

Notice the question has three valid answers, and it asked for the least. Listing all of them and then picking is safer than stopping at the first one found.

**Worked example 2 — divisible by .** Find so that is divisible by .

The digit sum is , which must be a multiple of . So , giving or .

Taking the least, gives , and . Correct.

**Worked example 3 — divisible by .** Find so that is divisible by .

Counting from the right, the digits are , , , , .







This must be or a multiple of . Since is a single digit, is impossible, so



Checking: . Correct — and here the answer is unique.

**Worked example 4 — divisible by .** Find so that is divisible by .

Only the last two digits matter, so must be divisible by . Testing: , , , and are all divisible by , while , , , and are not.

So must be even: . The least is , giving , and . Correct.

The pattern across these four. The number of answers depends on the test. A digit-sum test gives several answers spaced by or ; the alternating-sum test for usually gives exactly one, because is larger than any single digit can compensate for. So expect one answer for and several for , and — and read whether the question wants the least, the greatest, or all of them.

Why does each divisibility rule actually work?

Write the number in generalised form and split it into a part that is obviously divisible and a remainder. The test is always about the remainder.

**Divisibility by and by .** For a three-digit number:





The first part is a multiple of whatever the digits are. So the whole number is divisible by ** exactly when the digit sum** is — and since is a multiple of , the same split proves the test for **.

This also explains why the rule works for a number of
any** length: , and so on are all multiples of , so every place value contributes a multiple of plus its own digit.

**Divisibility by .** Split differently:





The first part is a multiple of . So the number is divisible by **** exactly when — the alternating sum of the digits — is. And that alternating sum is precisely odd places minus even places.

The reason the signs alternate is that leaves a remainder of when compared with : , , , and so the place values contribute in turn.

**Divisibility by .** A four-digit number can be written as



Since is divisible by , the first term is a multiple of whatever is. So only the last two digits matter.

**Divisibility by .** The same argument with :



and is divisible by , so only the last three digits matter.

**Divisibility by , and .** Every place value except the units is a multiple of , and is divisible by , by and by . So the whole number minus its units digit is always divisible by each of them, and only the units digit decides.

The single idea behind all seven proofs. Each test asks what do the place values give me for free? For it is ; for it is ; for it is every multiple of ; for every multiple of . Whatever is left after removing the free part is the test — which is why the tests look so different from one another despite being proved the same way.
Exam tip

Exam tip: count the places for eleven from the right

For the ** test, number the places from the right — units is the first place. Counting from the left reverses the two sums and, for a number with an even count of digits, changes the sign of the difference.

Accept
** as a valid difference in the test. A difference of zero means the number is divisible by , and treating it as a failure is a common error.

For **, always check both and and say so. And do not** try the same splitting trick on as — it does not work, because and share a factor.

Use the right amount of the number: units digit for , and ; last two for ; last three for ; digit sum for and ; alternating sum for .

In a missing digit question, list all the valid digits before answering, then read whether the question wants the least, the greatest or all of them.

When the missing digit appears in a digit-sum test, write the sum as an expression in — *the digit sum is * — and then state which multiples are reachable.

For a justification, show the split into a visibly divisible part and a remainder, and then name the remainder as the test. That factorised line is the mark.

And verify the finished number by actually dividing it. One line, and it settles the answer.
Did you know

Why do the signs alternate in the test for eleven?

Every other divisibility test adds digits. The test for alternately adds and subtracts them, which looks arbitrary until you look at the place values.

Compare each place value with a multiple of :

- , so ten is one short of a multiple of
- , so a hundred is one over
- , so a thousand is one short again
- , one over

The pattern of leftovers runs — flipping sign at every place. So a digit in the tens place contributes of itself beyond a multiple of , a digit in the hundreds place contributes , and so on.

Adding up those leftovers gives exactly the alternating sum of the digits, and the number is divisible by when the leftovers cancel out.

The same reasoning explains the ordinary tests too. Compared with , every place value is one over, , — so every leftover is and the test is a plain sum. The tests differ only because sits just below a power of ten and just above it.
Key takeaways

Divisibility tests and their proofs: quick revision

- **By ** — units digit is . **By ** — units digit or . **By ** — units digit .
- **By ** — digit sum divisible by . **By ** — digit sum divisible by .
- **By last two digits** divisible by . **By last three digits** divisible by .
- **By — divisible by both and **. The same trick fails for as , because and share a factor.
- **By — the difference between the digit sums in the odd and even places, counted from the right**, is or a multiple of .
- : digit sum , so divisible by , and (with an even last digit) ; but is not divisible by , so neither is the number.
- : last three digits , so divisible by ; and .
- : odd places , even places , difference — divisible by , and .
- Missing digits by : digit sum needs a multiple of , so and the least is , giving .
- by : needs a multiple of , so ; .
- by : difference must be , so uniquely; .
- by : must be divisible by , so is even; .
- Proofs gives the and tests; gives the test; gives the test; gives the test; and every place value above the units being a multiple of gives the , and tests.
- The common idea: split off what the place values give for free, and whatever remains is the test.

Try testing one five-digit number against all nine divisors, then solve a missing-digit problem for — the alternating sum is the test students get wrong most often, and it is the one with a unique answer.

Ready to put this into practice?

Create a personalized quiz on this exact topic — free to start.

Create your own quiz on Playing with Numbers — Part 2Create a free account
← Back to all articles