Q8: If is divisible by , then it is divisible by both and .
SOLUTION
UNDERSTAND THE QUESTION
- We need to determine whether the statement "If is divisible by , then it is divisible by both and " is true or false, and justify it using fundamental arithmetic properties taught in Class 9.
- Divisibility means that when an integer is divided by another integer, the remainder is .
- Since can be factored into (or using prime factorization ), we examine the relationship between factors and multiples.
Step 1 — STATE THE MEANING OF DIVISIBILITY
To say that an integer is divisible by means that is a factor of , or equivalently, is a multiple of .
Therefore, we can write:
where is some integer.
Step 2 — CHECK DIVISIBILITY BY
We can express as a product of and (since ):
Let . Since is an integer, is also an integer.
Thus, , which shows that is a multiple of . Therefore, is divisible by .
Step 3 — CHECK DIVISIBILITY BY
Similarly, using the expression for :
Let . Since is an integer, is also an integer.
Thus, , which shows that is a multiple of . Therefore, is divisible by .
Step 4 — CONCLUSION
Since is divisible by both and whenever it is divisible by , the given statement is true.
ANSWER
The statement is True. If a number is divisible by , it is necessarily divisible by both and because and are factors of .
COMMON MISTAKES
- Confusing factors and multiples: Confusing the direction of divisibility (e.g., assuming if a number is divisible by and , it must be divisible by , which is not always true without checking co-primes like and ).
- Skipping algebraic justification: Failing to express in the form to rigorously demonstrate the factor property.