For any natural numbers , and , such that divides both and must be a common divisor of
For any natural numbers , and , such that divides both and must be a common divisor of
Solution
Given: divides both and .
Our goal is to find what must be a common divisor of.
Easy Approach:
Take values!
Let (don't take 1 in questions like these).
can divide:
I)
II)
Only can divide the above two numbers.
Now, let's check the options:
A) -> both are not divisible by .
B) -> both are not divisible by .
C) -> both are not divisible by .
D) -> ✅ both divisible by .
Conceptual Approach:
If a number divides two expressions, then also divides any combination you can make by adding, subtracting, or multiplying these expressions by constants.
Since divides both and , let's create a combination that isolates .
From , multiply by 2:
divides
Now we have:
divides
divides
Since divides both expressions, must also divide their difference:
Therefore, divides .
Now let's create a combination that isolates the terms.
From , multiply by 3:
divides
Now we have:
divides
divides
Taking the difference:
Therefore, divides .
must be a common divisor of and
This method uses the fundamental property that divisors are preserved under linear combinations. By cleverly choosing multiples and taking differences, we can isolate the terms we want to analyze. This technique is extremely useful for divisibility problems involving multiple variables.