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 above
- Explain why each rule works, from place value for most, and from combining two rules for
- 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.
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.
Check your understanding
Since is a factor of , which statement says the same thing a different way?
" is a factor of ", " is divisible by ", and " is a multiple of " are three names for one fact: with remainder .
The other two factor-or-multiple options have the direction backwards: is the larger number built from , so it is that is the multiple, never the smaller . And a remainder of is exactly what makes a factor in the first place, not something that rules it out.
The one idea behind most rules
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 for , , , , , , and 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. The rule for works differently: it does not split the number at all, and instead combines two of these rules, as the last section of the lesson shows.
Check your understanding
Why does testing for divisibility by , , and only require looking at the last digit, ?
The whole idea is splitting off a part that is already known to divide evenly, so only the leftover has to be tested.
Because is a multiple of , and , that part already leaves remainder for , , and all at once. Only the leftover can still change the verdict. That happening to be even is a separate fact about this particular number, not the reason the shortcut works in general, and the digit count plays no role at all. The addition fact does not by itself explain the shortcut either, since it says nothing about ; the decisive fact is that , specifically, is a multiple of , , and .
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.
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.
If the digit sum is still large, add its digits again, and repeat until the total is small enough to read at a glance. For the digits give , and adding once more gives . Because is divisible by but not by , the original is divisible by but not by .
Check your understanding
Why does testing for divisibility by come down to just adding its digits, ?
The whole idea is splitting off a part that is already known to be a multiple of , so only the leftover has to be tested.
Each place value (, ) hands over a multiple of and leaves behind one copy of its own digit, so the first group is a multiple of no matter what the digits are. Only the digit sum can still change the verdict. The digit count is a fact about this number's length, not the reason the shortcut works in general, and landing exactly on is special to this number, not the mechanism itself; the shortcut replaces division exactly, it does not merely go faster than it.
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.
Check your understanding
Why does testing for divisibility by come down to checking just the last two digits, ?
The whole idea is splitting off a part that is already known to be a multiple of , so only the leftover has to be tested.
Because , every hundred is a multiple of , so the hundreds in already leave remainder . Only the leftover can still change the verdict. The digit count is a fact about this number's length, not the reason the shortcut works in general; being easy to divide is a separate convenience; and knowing only that and add back to does not by itself explain the shortcut, since that addition fact says nothing about being a multiple of .
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 .
Check your understanding
Which number is divisible by but not by ?
Check the last two digits for and the last three digits for , separately.
So passes the test but fails the test. By contrast, passes both, since its last three digits give . The other two fail the test already: ends in , and ends in , neither a multiple of .
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 .
Here is why passing both tests is always enough, without any letters. Look at the multiples of in order, starting from : . They alternate even, odd, even, odd, forever, because adding to an even number gives an odd one and adding to an odd number gives an even one. So exactly every other multiple of is even, and those are exactly the numbers passing both the test and the test at once. But the even multiples of are exactly the multiples of : . Passing both tests always lands you on one of those.
This combining trick works whenever the two factors share no common factor bigger than , as and do not. It does not work to build a test for by running the test twice over, because there the two factors are both rather than different numbers, and passing the test once already guarantees passing it again. For the split into a and a is clean, so the combined test is exactly right.
Check your understanding
Why does passing both the test and the test guarantee divisibility by , rather than just make it likely?
Passing both tests is not a coincidence, it is forced.
Adding to an even number gives an odd one, and adding to an odd number gives an even one, so the multiples of alternate even and odd forever. Exactly every other one is even, and those even multiples of are exactly , the multiples of . So any number that clears both tests has to be one of them. There is no operation that 'adds' two divisibility tests together; plenty of multiples of are odd, like and , so being divisible by never by itself guarantees being divisible by ; and being the larger number is just arithmetic, not a reason the combined test is exact.
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 .
The last two digits form , and , so it is divisible by .
The last three digits form , and , a remainder of , so is not divisible by .
So is divisible by every one of and , but not by . Notice how one digit sum () settled both the and the questions, the single trailing zero settled three tests by itself, and the two block tests for and gave different verdicts even though they look alike. The rules share their work, and each one still has to be checked on its own terms.
Check your understanding
A whole number ends in and has digit sum . Which of these is it?
Both clues have to hold at once: the last digit must be , and the digits must add to .
So fits both clues. Of the others, ends in but its digits add to , has digit sum but ends in , and fits neither clue.