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

← All study notes

One Counterexample Destroys a Rule That Looks Obvious

Learn how divisibility passes to multiples and factors, why a divisor of two numbers divides their sum and difference, when two divisors combine into a bigger one, and how to disprove a claim with a single example.

How can one example prove a whole rule wrong?

Because a rule claims to hold for every number, so a single case where it fails destroys it completely. "Every number divisible by 4 is divisible by 8" collapses the moment you notice 12.

That single example is called a counterexample, and finding one is a complete proof. This page covers everything in the CBSE Class 8 Mathematics chapter's first part: divisibility of multiples and factors, sums and differences, combining divisors, and counterexamples.

How does divisibility pass to multiples and to factors?

Two related properties, and both are easy to see once stated.

Every multiple of a divisible number is divisible too. If aa is divisible by bb, then every multiple of aa is also divisible by bb.

Since 1212 is divisible by 33, so are 2424, 3636, 4848 and 120120 — every multiple of 12.

The reason is that a multiple of 12 is a multiple of 12 groups of 3, so it splits into 3s exactly.

A number is divisible by every factor of its divisor. If aa is divisible by bb, then aa is divisible by every factor of bb.

Since 3636 is divisible by 1212, and the factors of 12 are 1,2,3,4,6,121, 2, 3, 4, 6, 12, the number 36 is divisible by all of them:

362=18,363=12,364=9,366=6\frac{36}{2} = 18, \quad \frac{36}{3} = 12, \quad \frac{36}{4} = 9, \quad \frac{36}{6} = 6

All whole numbers, as predicted.

Worked use. A number is known to be divisible by 2424. Without knowing the number, you can say at once that it is divisible by 1,2,3,4,6,8,121, 2, 3, 4, 6, 8, 12 and 2424, since those are the factors of 24.

Packing is the everyday version: a quantity that fills boxes of 12 exactly will also fill boxes of 6, of 4, of 3 and of 2 exactly.

The direction is what must not slip. Divisibility passes upward to multiples and downward to factors — but a number divisible by 4 need not be divisible by 8, because 8 is a multiple of 4, not a factor of it.

Why does a common divisor divide the sum and the difference?

Because if both numbers are built from groups of aa, then so is their total and so is what is left when one is taken from the other.

The property: if aa divides mm and aa divides nn, then aa divides m+nm + n and aa divides m−nm - n.

Worked example. 33 divides 1212 and 33 divides 1818. Therefore:

3∣(12+18)=30,3∣(18−12)=63 \mid (12 + 18) = 30, \qquad 3 \mid (18 - 12) = 6

Both check out, since 30÷3=1030 \div 3 = 10 and 6÷3=26 \div 3 = 2.

Worked example. Is 44 a divisor of 24+3624 + 36? Since 44 divides 2424 and 44 divides 3636:

4∣60,and indeed 604=154 \mid 60, \qquad \text{and indeed } \frac{60}{4} = 15

Worked example on a compound expression. Is 7×15+7×237 \times 15 + 7 \times 23 divisible by 77? Both terms are multiples of 7, so their sum is:

7(15+23)=7×38=266,2667=387(15 + 23) = 7 \times 38 = 266, \qquad \frac{266}{7} = 38

Worked example with a mixed case. Is 25+1425 + 14 divisible by 55? Here 55 divides 2525 but not 1414, so the property does not apply — and 3939 is indeed not divisible by 5.

The condition is that aa must divide both numbers, and that is where the property is misused. If aa divides only one of them, nothing follows about the sum — 33 divides 99 but not 1010, and their sum 1919 is not divisible by 3 either. So check both before applying it.

When do two divisors combine into a bigger one?

When the two divisors are co-prime — sharing no common factor except 1. Then a number divisible by both is divisible by their product, which is also their LCM.

Worked example. A number is divisible by 33 and by 44. Since 33 and 44 are co-prime, it is divisible by

3×4=123 \times 4 = 12

Testing on 8484: the digit sum 8+4=128 + 4 = 12 is divisible by 3, and 84=4×2184 = 4 \times 21 is divisible by 4. So 84 should be divisible by 12, and indeed

8412=7\frac{84}{12} = 7

Worked example. A number divisible by 22 and 99, which are co-prime, is divisible by 1818. Testing 126126: it is even, and 1+2+6=91+2+6 = 9 is divisible by 9, so 126÷18=7126 \div 18 = 7.

Worked example. A number divisible by 55 and 66 is divisible by 3030, since 5 and 6 are co-prime.

Now the failure case, which is the heart of this section. A number divisible by 22 and 44 is not necessarily divisible by 88, because 22 and 44 are not co-prime — both contain a factor of 2.

Counterexample: 1212 is divisible by 2 and by 4, but

128=1.5\frac{12}{8} = 1.5

So 12 is not divisible by 8. The correct combination for non-co-prime divisors is their LCM, and the LCM of 2 and 4 is 44, not 8 — which is all you may conclude.

How do you build a counterexample to disprove a claim?

Find one number that satisfies everything the claim assumes but fails what it concludes. That is enough, because the claim asserted it held for all numbers.

Claim: Every number divisible by 4 is divisible by 8.

Take 1212. It is divisible by 4, since 12÷4=312 \div 4 = 3. But 12÷8=1.512 \div 8 = 1.5, not a whole number. So the claim is false, and 1212 is the counterexample. So are 2020, 2828 and 3636.

Claim: If a number is divisible by 2 and by 6, it is divisible by 12.

Take 1818. It is divisible by 2 and by 6, yet 18÷12=1.518 \div 12 = 1.5. False — and it fails because 2 and 6 are not co-prime.

Claim: If a number is divisible by 3 and by 9, it is divisible by 27.

Take 99 itself. It is divisible by 3 and by 9, but not by 27. False.

Claim: The sum of two numbers divisible by 5 is divisible by 10.

Take 55 and 1010. Both are divisible by 5, and their sum is 1515. But

1510=1.5\frac{15}{10} = 1.5

so the sum is not divisible by 10. The claim is false, and 5+105 + 10 is the counterexample. What is actually true is the sum-and-difference property from earlier: the sum is divisible by 5.

Notice how easily this one could have been missed. The pairs 5+15=205 + 15 = 20, 10+20=3010 + 20 = 30 and 15+25=4015 + 25 = 40 all give multiples of 10, so three confirming examples would have suggested the claim was safe — and it is not.

The rule about evidence is the point of the whole section. One counterexample disproves; any number of confirming examples never proves. Checking 3, 12 and 24 for the first claim would have found no problem at all — the disproof needed exactly the right number.
Exam tip

Exam tip: checking whether the divisors are co-prime

This chapter turns on one check, so make it first.

Before combining two divisors, ask whether they are co-prime. If they share a factor, you may only conclude divisibility by their LCM — so 2 and 4 give 4, not 8.

When applying the sum-and-difference property, confirm the divisor divides both numbers. If it divides only one, nothing follows.

To disprove a claim, give one specific number and show the arithmetic both ways: *12 is divisible by 4 since 12÷4=312 \div 4 = 3, but 12÷8=1.512 \div 8 = 1.5, so the claim is false.* Both divisions are marked.

Never try to disprove a claim by listing examples that work — and never treat confirming examples as a proof.

And remember the direction: divisibility passes to multiples of the number and to factors of the divisor, never to multiples of the divisor.
Did you know

Why is one failing example enough to settle the matter?

Because of what the claim promised.

Saying "every number divisible by 4 is divisible by 8" is a promise about all such numbers, without exception. The number 12 satisfies the condition and breaks the conclusion, so the promise has already been broken — nothing further needs checking.

The reverse is not true, and that asymmetry is what makes mathematics careful. Testing twenty numbers that all work leaves the twenty-first untested, so it can never finish the job. Disproof takes one example; proof takes an argument covering every case at once.
Key takeaways

Divisibility properties and counterexamples: quick revision

- If aa is divisible by bb, then every multiple of aa is divisible by bb, and aa is divisible by every factor of bb — so a number divisible by 24 is divisible by 1, 2, 3, 4, 6, 8, 12 and 24.
- Divisibility passes to
multiples of the number and factors of the divisor
, never to multiples of the divisor.
- If aa divides both mm and nn, then aa divides m+nm + n and m−nm - n — so 33 dividing 12 and 18 means it divides 30 and 6.
- Two divisors combine into their product only when they are co-prime: divisible by 3 and 4 means divisible by 12.
- When they share a factor, only the LCM follows — 12 is divisible by 2 and 4 but not by 8.
- One counterexample disproves a claim, while no number of confirming examples ever proves it.

You will remember all of this far better after answering five questions on it than after reading it twice.

Ready to put this into practice?

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

Create your own quiz on Number Play — Part 1Create a free account
← Back to all articles