PrepShorts · Study sheet · Class 8 Mathematics · Chapter 5, Number Play
Chapter 5 · Number Play
Divisibility by 6 and other numbers, checked through their factors
This video could not be loaded. Reload the page to try again.
Sign in with Google10 min.
Keep your place in this chapter — sign in, it’s free.Sign in
Six has no divisibility test of its own and does not need one. Test 2, test 3, and a number passing both is a multiple of 6.
The idea
You can test a composite divisor by breaking it into two smaller divisors you already know how to test — but only if the two pieces share no prime. Divisibility is a statement about which primes a number carries and how many copies of each, so two pieces that both need a two let a number satisfy them both while supplying that two only once. The rule that actually governs this is the one the chapter proved earlier: two divisors together force divisibility by their least common multiple. Multiplying the pieces together is right precisely when their least common multiple is their product, and that is exactly when they share no prime.
What you should be able to do
- Test divisibility by 6 by testing 2 and 3, and verify the result by dividing
- Show, with one number, that testing 4 and 6 does not settle divisibility by 24
- Explain the failure in terms of prime factorisation, by counting how many copies of each prime each test guarantees
- Choose a pair of divisors whose tests together do settle a given composite, and justify the choice
- State the condition on the pair in terms of shared primes, and connect it to the LCM rule proved earlier in the chapter
- Split composite divisors met elsewhere in the chapter — 12, 15, 18, 36, 44 — into testable pieces
- Fill a divisibility table efficiently by testing only the primes and their powers, and deducing the rest
Words to know
| Term | Definition in one line | First introduced |
|---|---|---|
| prime factorisation | a number written as a product of primes | printed in this chapter (Part I, §5.1, p.121) |
| LCM | the least common multiple of two numbers | printed in this chapter (Part I, §5.1, p.121) |
| factor | a number that divides another exactly | printed in this chapter (Part I, §5.1, p.113) |
| multiple | a number obtained by multiplying a given number by a whole number | printed in this chapter (Part I, §5.1, p.116) |
| divisible | leaving nothing over on division | printed throughout this chapter |
| shortcut | the chapter's word for a divisibility test done without dividing | printed in this chapter (Part I, §5.2, p.123) |
| divisor | the number you are dividing by | standard vocabulary from earlier classes; this chapter says "divisible by" and does not print "divisor" |
| remainder | what is left when a division does not come out exactly | printed in this chapter (Part I, §5.1, p.116) |
| coprime | sharing no prime factor | an added term; this chapter states the condition through prime factorisation and never names it |
| bill of materials | the explanation's image for a prime factorisation read as a list of parts needed | an added image, not printed |
Where people slip up
- "Any two factors that multiply to the divisor will do." They must also share no prime. Four and six multiply to twenty-four and settle nothing, and the chapter's own number 12 proves it.
- "The tests for 4 and 6 must be broken, then." Both tests are fine. The split is what fails. Separating a wrong tool from a wrong plan is the useful habit here.
- "Six needs a rule of its own." It does not, and the section exists to show that. Two and three between them account for every prime in six, once each.
- "If two tests work for six, two tests work for everything." Six is the easy case because its two primes are different. Twenty-four is the honest case.
- "Divisible by four and divisible by six means divisible by twelve, so twelve is the answer, so twenty-four should be too." Twelve is the answer, and twenty-four is not; the LCM is where the chain stops. Draw the two prime inventories and count.
- "A number that passes more tests is more divisible." Passing extra tests that repeat a prime adds nothing. What matters is covering each prime to its full power exactly once.
- "There is no shortcut for a divisor like seven, so there is none." The chapter says the opposite: they exist for every divisor up to a hundred, and explaining them needs machinery from later classes.
Ask your teacher a person
Your teacher reads this and writes back, usually within a day. For an instant answer, use Ask the video in the sidebar.
Your class sees the question and the answer. Only your teacher sees that it was you.
No questions on this topic yet.
Worked answers to this chapter’s exercises · this video explains End-of-Chapter Figure it Out Q6, End-of-Chapter Figure it Out Q10
Transcript1,354 words
You have tests for two, for three, for four, for five, for eight, for nine, for ten and for eleven. You do not have one for six. And you are not going to get one, because six does not need one. Six is two times three. So ask two questions you can already answer. Is it even? Do its digits add to a multiple of three? If both answers are yes, the number is a multiple of six.
That is the claim. Now let us find out whether it is true, and then whether the same trick works everywhere else. Four numbers. Thirty-eight, two hundred and twenty-five, one hundred and eighty-six, and sixty-four. Thirty-eight is even, and its digits add to eleven, which is no multiple of three. So it passes one test and fails the other. Two hundred and twenty-five is odd. Its digits add to nine, so it passes the three test and fails the two test.
Sixty-four is even, and its digits add to ten. Same shape as thirty-eight: one yes, one no. One hundred and eighty-six is even, and its digits add to fifteen. Two yeses. Now divide all four by six and check. Only one hundred and eighty-six comes out exact. The two tests got it right. But notice what that set of four does not contain. One number fails only the three test. Two fail only the two test. One passes both.
Nothing there fails both. So let us add one: thirty-five. Thirty-five is odd, and its digits add to eight. Two noes. And thirty-five is not a multiple of six. That is the fourth corner, and it matters, because a rule you have only ever seen agree is not a rule you have tested. So now sweep it. Across nearly three thousand numbers, four hundred and ninety-nine are multiples of six, and the two tests agree with the division on every single number, not just those.
Six is settled. It never needed a rule of its own. So try the same move somewhere harder. Twenty-four. Twenty-four is four times six. You have a test for four and a test for six. Test both, and you have tested twenty-four. That sounds exactly as reasonable as the last one. It is false. Here is the number that kills it. Twelve. Twelve is a multiple of four. Twelve is a multiple of six. Twelve is not a multiple of twenty-four.
One number, and the claim is not weakened but dead. And it is not a freak. Across those same three thousand numbers the four-and-six split gets the answer wrong a hundred and twenty-five times. Now, the tempting reaction is to distrust the tests. Do not. Both tests are perfectly good. The test for four really does find every multiple of four. Seven hundred and forty-nine of them in that range, exactly right.
The test for six really does find every multiple of six. Four hundred and ninety-nine, exactly right. Neither tool is broken. The plan is broken. That distinction is worth keeping. A wrong answer from two correct steps means the way they were combined is where to look. To see where, stop thinking about factors and start counting primes. Every number is built from primes, and what matters is not just which primes but how many copies of each.
Twenty-four is two times two times two times three. Three twos and a three. Read that as an order. To be a multiple of twenty-four, a number must supply three twos and a three. Four is two twos. Six is one two and one three. Eight is three twos. Three is just a three. Now every test becomes a demand for parts, and the question is whether two demands together add up to the order.
Put four and six side by side. Four demands two twos. Six demands one two and one three. Between them, how many twos are guaranteed? Not three. Two. Because the number only has to supply its twos once. Six's two can be one of the two that four already asked for. The two demands overlap, and the overlap is a prime they both need. So the pair guarantees two twos and a three, and twenty-four wants three twos and a three. It is one two short.
Now try three and eight. Three demands a three. Eight demands three twos. No overlap. Three twos and a three, which is exactly the order. That is why the repair works. There is something satisfying hiding here. Four and six do not settle nothing. They settle something exact. Two twos and a three is twelve. So passing both tests guarantees a multiple of twelve. And that is exactly what happens. Two hundred and forty-nine multiples of twelve in that range, and the split finds precisely those.
Twelve is the least common multiple of four and six. Two divisors always force divisibility by their least common multiple, and never by anything larger. That is the whole story. The split told you the truth. You asked it the wrong question. So here is the condition, and it is short. Two tests settle their product exactly when the two share no prime. Share none, and the demands stack up with nothing wasted, so the least common multiple is the product.
Share one, and that prime gets asked for twice and supplied once, so the least common multiple falls short of the product. And this is not a rare trap. Sweep every pair of divisors from two to twenty-five: three hundred pairs, and a hundred and twenty-five of them share a prime. About two in every five. If you pick a split without checking, you are wrong that often. So take the composite divisors you actually run into, and split them properly.
Twelve is four and three. Fifteen is three and five. Eighteen is two and nine. Thirty-six is four and nine. Forty-four is four and eleven. Twenty-four, of course, is three and eight. Look at those pairs. Not one of them shares a prime, and every one of them multiplies to its divisor. Both conditions matter. Two and twelve multiply to twenty-four and share a two, and twelve breaks that one as well.
Six and six multiply to thirty-six and share both primes. Six breaks it immediately. So check two things every time. Do they multiply to the divisor, and do they share nothing? Now a job that looks like ninety pieces of work. Ten numbers, nine divisors, and a yes or a no in every cell. The nine divisors are two, three, four, five, six, eight, nine, ten and eleven. You do not test nine of them. You test seven.
Six is two and three, which are both already in the list. Ten is two and five, also both in the list. Neither shares a prime. So once the two column, the three column and the five column are filled, the six column and the ten column can simply be read off. Two whole columns, twenty cells, done without a single division. And they come out right on all ten numbers, because those splits meet the condition.
One last thing, and it is a habit rather than a rule. Here is a filled-in row for a hundred and twenty-eight. Yes under two. No under four. Yes under eight. You do not need to divide anything to know that row is wrong. Four goes into eight. So anything eight divides, four divides too, always, with no exceptions anywhere. A yes under eight and a no under four is not an unusual number. It is impossible.
And it really is one-way. Plenty of numbers are multiples of four and not of eight: three hundred and seventy-five of them in that range. That row is perfectly ordinary. So a hundred and twenty-eight is a multiple of four, and it is four times thirty-two. There are shortcuts like this for far more divisors than the ones you have met, and the rest need ideas that come later. But the thinking does not change. Count the primes, and check that nothing is being asked for twice.
Where this fits
Taken from the notes each video was made from, not from the reading order — these are the ideas this one rests on and the ones that later rest on it.
Builds on
- The four divisibility facts you can prove, and how to use themClass 8 · Ch 5, Number Play
- The digit-sum test for 9, and the algebra underneath itClass 8 · Ch 5, Number Play
- Why the same digit sum also settles divisibility by 3Class 8 · Ch 5, Number Play
- The alternating-sum test for 11Class 8 · Ch 5, Number Play
- Always, sometimes, or never: one counterexample settles itClass 8 · Ch 5, Number Play
Either side of this one
- Digital roots, and what survives repeated digit-summingClass 8 · Ch 5, Number Play