Q15: Consider the statement: ‘If a number is divisible by 8, then it is divisible by both 2 and 4’. (i) Justify the statement. (ii) Recall the divisibility shortcuts that we have studied for different numbers. To check whether a given number is divisible by 8, is it enough to check whether it is divisible by 2 and 4? Why or why not?
UNDERSTAND THE QUESTION
- We need to analyze the logical statement: 8 2 .
- Part (i) requires justifying the statement using fundamental properties of divisibility and factors.
- Part (ii) requires examining the converse/reverse logic using divisibility rules to determine if checking divisibility by 2 and 4 is sufficient to guarantee divisibility by 8.
(i)PART I
Justify the statement: 'If a number is divisible by 8, then it is divisible by both 2 and 4'.Step 1 — DEFINE DIVISIBILITY BY 8
Let be an integer that is divisible by . By definition of divisibility, we can write:
where is some integer.
Step 2 — CHECK DIVISIBILITY BY 2
We can rewrite by factoring as :
Since is an integer, is a multiple of . Therefore, is divisible by .
Step 3 — CHECK DIVISIBILITY BY 4
Similarly, we can rewrite by factoring as :
Since is an integer, is a multiple of . Therefore, is divisible by .
Step 4 — CONCLUSION FOR PART (I)
Since any number divisible by contains (and hence and ) as its factor, the statement is true and fully justified.
ANSWER (I)
The statement is true because any number divisible by 8 has 8 as a factor, which means it also has both 2 and 4 as factors.
(ii)PART II
Recall the divisibility shortcuts that we have studied for different numbers. To check whether a given number is divisible by 8, is it enough to check whether it is divisible by 2 and 4? Why or why not?Step 1 — ANALYZE THE CONVERSE QUESTION
We need to determine if the reverse is true: Does divisibility by both and always imply divisibility by ?
Step 2 — TEST WITH A COUNTEREXAMPLE
Consider the number :
- Is divisible by ? Yes ().
- Is divisible by ? Yes ().
- Is divisible by ? No ( is not a multiple of ; leaves a remainder of ).
Another example is :
- Divisible by and , but not by .
Step 3 — CONCLUSION FOR PART (II)
It is not enough to check only if a number is divisible by and . While every number divisible by is divisible by (and ), the converse is false because numbers can be divisible by without being divisible by (e.g., ). To test for divisibility by , we must check if the number formed by the last three digits is divisible by .
ANSWER (II)
No, it is not enough. For example, 12 is divisible by both 2 and 4, but it is not divisible by 8.
COMMON MISTAKES
- Confusing implication with equivalence: Assuming that because , the converse must also be true.
- Ignoring counterexamples: Failing to test numbers like 12 or 20 which satisfy the condition of being divisible by 2 and 4 but fail the test for 8.