Divisibility Rules
Learning goals
- Test for , and by reading the last digit
- Add the digits to settle and
- Check the last two or three digits for and
- Combine the and tests for , since they share no factor
- Explain every rule by splitting the number with place value
- State what divisible means, and tie factor to multiple
What “divisible” means
One whole number is divisible by another when you can divide them and nothing is left over. The number is divisible by , because with a remainder of . The number is not divisible by , because with a remainder of ; that leftover is what disqualifies it. Divisibility is all about the remainder being zero, nothing else.
The same fact can be stated three ways, and reading them as interchangeable will save you confusion later:
- is divisible by .
- is a factor (also called a divisor) of .
- is a multiple of .
Each sentence says that can be cut into a whole number of equal groups of , here four groups, leaving none behind. Every whole number greater than has at least two divisors: and the number itself. Dividing by gives one group holding everything, and dividing by the number itself gives one group of its own size.
The remainder is the only thing worth watching, so it is worth seeing rather than trusting. Below you choose how many dots there are and how many go in each row. Dots that cannot complete a row are drawn hollow, and those hollow dots are the remainder.
Divides evenly, or leaves a remainder
12 dots in rows of 5 make 2 full rows with 2 dots left over. So 5 is not a factor of 12.
Set the count to and step the row width from up to . Exactly two of those five widths leave nothing hollow, and each of the other three leaves a remainder you can count on the picture. Then set the count to and walk the same widths again. Every one of those widths leaves something over, which is what a number with no divisor in that range looks like.
The one idea behind every rule
There is a single move underneath all of these tests: break the number into pieces along its columns. Then throw away the pieces that are obviously multiples of your divisor, and test only what is left.
Try it on with a divisor of . Split into . Each piece is a multiple of on its own, since and . Push them back together and you are holding fours alongside fours, which is fours in total. So , and divides it with nothing over.
The numbers and did no special work there. Their counts of fours, and , could simply be added because both pieces were measured in fours to begin with.
Watch that happen again with a divisor of . Both and are multiples of , since is six threes and is four threes. Put them together and you are holding six threes alongside four threes, which is ten threes. So is a multiple of as well. Take them apart instead, and six threes minus four threes leaves two threes. So is a multiple of too.
Nothing there depended on the numbers being and . Two piles counted in the same unit can be added or subtracted just by adding or subtracting how many units each one holds. Write for that shared unit, and and for the two counts. What you get is the distributive property you have already met, read in reverse:
So a number that divides two others also divides their sum and their difference. Every rule below uses this once. We split the number into two parts: a big part that is plainly a multiple of , contributing remainder , and a small leftover. Then the whole question rests on that leftover alone.
Divisibility by 2, 5, and 10: read the last digit
These three are the easiest tests, and they share one reason: every column except the ones is a multiple of .
Take again. The and the combine into , which is tens, a clean multiple of . And is , so those tens are a multiple of and a multiple of as well. All three divisions therefore come out even on the part alone. Only the is still waiting to be judged.
Nothing in that split was special to . The tens, hundreds, thousands, and all columns to the left are made of tens, so any whole number, however long, can be written as
So whatever decides divisibility by , , or has to live in the last digit alone. That is because everything else was already a multiple of all three.
Why only the last digit matters for , , and #
Run the argument on before running it on letters. Peel the last digit away and you have . That is tens, so it equals . And is , so the same piece is a multiple of and a multiple of . All three divisions therefore leave nothing over on the , and each verdict rests on the alone. The is even, so is divisible by , and it is neither nor , so the test for fails. It is not either, so is not a multiple of .
Nothing there used the particular digits of . Write any whole number as , where is its ones digit and is everything else. That leftover is built from the tens column and up, so it counts a whole number of tens: for some whole number .
Since , that piece is a multiple of , of and of at once. So it leaves remainder in all three tests. By the splitting idea from the last section, passes one of those tests exactly when the leftover digit passes it:
- Divisible by : the ones digit must be , the only single digit that is a multiple of .
- Divisible by : the ones digit must be or , the single-digit multiples of .
- Divisible by : the ones digit must be or , an even digit.
Any other last digit leaves a nonzero remainder, so the number fails.
A number whose last digit is even is called an even number, and any other whole number is odd. So “even” and “divisible by ” are two names for the same property, and you check both by glancing at the final digit.
Worked example 1 Test for divisibility by , , and
Everything depends on the ones digit, which is .
To see why the rest drops out, split off that last column:
where the piece is tens, already a multiple of . The leftover ones digit is , and is a multiple of , of , and of at once.
So is divisible by (the digit is even), by (the digit is ), and by (the digit is ). Any number ending in clears all three tests together.
Check your understanding
Which of these numbers is divisible by but not by ?
Look only at each last digit. Divisible by needs an even last digit; divisible by needs a last digit of or .
So is divisible by but not by . Both and are divisible by , and ends in an odd digit, so it is not divisible by .
Divisibility by 3 and 9: add the digits
For and the last digit is useless: is divisible by but is not, and both end in . The right test is the well-known one, add every digit and check that sum. The digits of add to , which is divisible by both and , so is too. This looks like a coincidence, but it comes out of place value as neatly as the last-digit rules. You only have to notice one thing about the numbers and so on.
The key fact is that each of those place values is exactly one more than a multiple of :
and , , and are all multiples of (and of ). So suppose a digit sits in the tens column. That digit’s contribution breaks into , which is a multiple of , plus a single leftover . Every column behaves the same way: it donates a multiple of and leaves one copy of its own digit. Sweep up all those leftovers and you have the digit sum.
Why the digit sum decides divisibility by (and by )#
Work it on first. Written out column by column, that number is
Swap each place value for a multiple of plus , using , and :
Multiply out, then sort the pieces into the multiples of and the bare digits:
Every column has handed over a multiple of and kept only its own digit. The first group comes to , which is , so it leaves remainder . The question lands on the leftover , which is . So is divisible by , and dividing confirms it: .
Nothing there depended on the digits being and , so now use letters in their place. Take a four-digit number with digits , , and , from the thousands column down. Its value is
Swap each place value for “a multiple of , plus ”, exactly as before:
Multiply out, then sort the multiples of to one side and the bare digits to the other:
The first group is a multiple of whatever the digits are, so it leaves remainder . By the splitting idea, is divisible by exactly when the leftover , its digit sum, is.
For , note that , so each of those s, s and s is a multiple of as well. The same argument then shows that is divisible by exactly when its digit sum is. A shorter number simply drops terms and a longer one adds more, namely and so on. Each is still a multiple of , so the rule holds at any length.
If the digit sum is itself unwieldy, add its digits, and keep going until one digit remains. For the digits give , and . Because is divisible by but not by , the original is divisible by but not by .
Worked example 2 Is divisible by ? By ?
Add the digits:
Now test the digit sum . It is divisible by , since , but not by , since and step right over .
If you cannot read at a glance, fold it once more: , which is divisible by and not by , the same verdict. So is divisible by but not by .
This also explains why every multiple of is automatically a multiple of . If the digit sum clears the higher bar of , it has certainly cleared , because is itself a multiple of .
Check your understanding
Find the digit that goes in the blank so that is divisible by .
A number is divisible by when its digit sum is. The known digits give , so the missing digit has to make a multiple of .
The next multiple of would need , which asks for , not a single digit. So , giving .
Divisibility by 4 and 8: check the last two or three digits
The rule for used digit sums, but goes back to the splitting idea, just one column deeper. The fact we need is that is a multiple of , since .
Take and cut it at that point, into . The piece is hundreds, and every hundred is , so those hundreds come to exactly. That piece leaves nothing over. The whole question drops onto the , and , so is divisible by .
The same cut works on any number, because the hundreds, thousands, and higher part always counts a whole number of hundreds:
That part is a multiple of , and therefore of , so it contributes no remainder. So divisibility by depends only on the number made by the last two digits.
The very same reasoning, pushed out one more column, gives the rule for . Here is a multiple of , because , so everything from the thousands column up is a multiple of . That is why divisibility by depends only on the last three digits.
Why the last two digits decide divisibility by #
Take first. Splitting off the last two digits gives . That is hundreds, and a hundred is , so the piece equals and leaves nothing over. Only the is left to judge, and , so is divisible by . Dividing confirms it: .
Now cut the same number one column further out, for . That gives , and the is thousands, each of them , so that piece is and again leaves nothing. Everything rests on the , and with left over. So is not divisible by , even though it passed for .
The , the and the played no special part, so run it again with letters.
Write , where is the number formed by the tens and ones digits, the last two. The other piece is everything from the hundreds column up. Because is built only from hundreds and higher columns, it counts a whole number of hundreds. So for some whole number .
Since , regroup it as . So is a multiple of whatever is, and it leaves remainder . By the splitting idea, is divisible by exactly when the two-digit leftover is. Testing is fast, because it never exceeds .
Stepping one column further out proves the rule for in exactly the same way. Now , so the part of from the thousands column up is a multiple of . Only the last three digits remain to be checked.
Worked example 3 Is divisible by ? By ?
For , ignore everything but the last two digits, which form :
so is divisible by .
For , keep the last three digits, which form , and test that smaller number:
so is divisible by as well. You have replaced a five-digit division with a check on , and even that is quick: , and the remaining is .
Divisibility by 6: combine 2 and 3
Some numbers carry no rule of their own. Instead you build a test from the rules for their factors. The tidiest example is .
Watch it happen on . The last digit is even, so divides it, and . The digit sum is , so divides as well. Now look at the sitting beside that . It is , so the factor of was waiting inside the other half all along. Collecting the pieces gives .
Because , a number is divisible by exactly when it is divisible by both and . You already own both tests, so you just run them together. Confirm that the last digit is even and that the digit sum is a multiple of .
Why passing both the test and the test means divisible by #
Watch it happen on , which passes both tests: it ends in , and its digits add to . Passing the test means . Now look at the partner . Since is even and the multiplier is odd, that evenness has to be coming from the , and indeed . Substituting it back gives .
Now the same steps in general. Suppose a number is divisible by . Then for some whole number . Suppose as well that is divisible by , so is even.
Look again at . The multiplier is odd, so the only way that product comes out even is for to be even. That means for some whole number , and substituting gives
a multiple of . The argument leaned on and sharing no common factor above . That independence is what forced the extra factor of to hide inside , rather than overlapping the .
This combining trick works whenever the two factors share no common factor bigger than , as and do not. It does not work to test as “divisible by , twice”, because there the two factors are both rather than different numbers. For the split into a and a is clean, so the combined test is exactly right.
Worked example 4 Is divisible by ?
Run the two tests that make up .
First, divisibility by : the last digit is , which is even, so passes.
Next, divisibility by : the digit sum is
and is a multiple of , so passes that test too.
It clears both halves, so is divisible by . As a check, .
Check your understanding
Which number is divisible by ?
A number is divisible by when it passes both the test and the test. That means an even last digit, and a digit sum that is a multiple of .
So clears both tests. Of the rest, is odd, while (digit sum ) and (digit sum ) fail the test.
Putting the rules to work
Together these tests are far quicker than long division. The rules pay off most when you stack several on one number to learn a lot in a single pass. Here is the whole toolkit:
| Divisor | Test |
|---|---|
| last digit is even () | |
| digit sum is a multiple of | |
| number formed by the last two digits is a multiple of | |
| last digit is or | |
| passes both the test and the test | |
| number formed by the last three digits is a multiple of | |
| digit sum is a multiple of | |
| last digit is |
Worked example 5 Which of divide ?
Run each test on in turn.
The last digit is , so the number is even and divisible by , by , and by all at once.
The digit sum is , which is , so the number is divisible by and by .
Because it passes the test and the test, it is divisible by .
Finally, the last two digits form , and , so it is divisible by .
So is divisible by every one of and . Notice how one digit sum () settled both the and the questions, and the single trailing zero settled three tests by itself. The rules share their work.
Check your understanding
A whole number ends in and has digit sum . Which of these is it?
Ending in rules out any number whose last digit is not , and a digit sum of is what we check next.
So fits both clues. Of the others, and do not end in , and ends in , not .