If n is divisible by 24, then it is divisible by both 4 and 6.
Step-by-step solution
To find: Frame the converse of this proposition. Then, determine if each of the two statements is true or not. Justify the true statements and give a counterexample for each false statement.
Idea: 24 is a multiple of both 4 and 6, so the proposition holds. But 4 and 6 share the factor 2, so the smallest number divisible by both is 12, not 24.
- Converse: If n is divisible by both 4 and 6, then it is divisible by 24.½ mark
- Proposition — true. If n = 24k, then n = 4 × 6k (divisible by 4) and n = 6 × 4k (divisible by 6).1 mark
- Converse — false. Counterexample: n = 12. 12 = 4 × 3 and 12 = 6 × 2, so 12 is divisible by 4 and by 6. But 12 < 24, so 12 is not divisible by 24.1 mark
- The reason: 4 and 6 have a common factor 2, so ‘divisible by 4 and 6’ only means ‘divisible by 12’ (their LCM), not by 4 × 6 = 24. Proposition true; converse false.½ mark
Answer to write in the exam
Converse: If n is divisible by both 4 and 6, then it is divisible by 24.
Proposition: n = 24k = 4(6k) = 6(4k) ⇒ divisible by 4 and 6. True.
Converse: 12 = 4 × 3 = 6 × 2, but 24 does not divide 12.
∴ Proposition true; converse false (counterexample: 12).
Common mistakes that cost marks
- Reasoning ‘divisible by 4 and 6 means divisible by 4 × 6 = 24’. That works only when the two numbers have no common factor other than 1.
- Giving 48 or 72 as a counterexample: they are divisible by 24, so they agree with the converse.
How this can come in the exam
Which number is divisible by both 6 and 8 but NOT by 48?
- 24
- 48
- 96
- 144
Show answer
(A) 24
24 = 6 × 4 = 8 × 3, but 24 is not divisible by 48. 48, 96 and 144 are all multiples of 48.
Is ‘If n is divisible by both 3 and 5, then n is divisible by 15′ true? Justify.
Show answer
Let n = 5k. 3 divides 5k, and 3 is a prime that does not divide 5, so 3 divides k (1 mark). Then k = 3m and n = 15m: true (1 mark).Try one yourself
Give a counterexample to ‘If n is divisible by 10 and by 15, then n is divisible by 150′.
Show answer
30 = 10 × 3 = 15 × 2 is divisible by 10 and 15, but not by 150.
More questions like this
- If n is divisible by 60, then it is divisible by both 5 and 12.
- If n is the square of a prime number, then it has exactly 3 factors.
- If n is a product of two unequal prime numbers, then it has exactly 4 divisors.
- If n and n + 3 have no factors in common, then n is not a multiple of 3.
- There are no known ‘neat’ expressions that generate only primes! Find counterexamples to the following claims.