Q3: (i) Find . (ii) Find . (iii) Find .
SOLUTION
UNDERSTAND THE QUESTION
The problem asks for the greatest common divisor (gcd) of three pairs of positive integers. In Class 9 NCERT, the gcd is found using the Euclidean algorithm: repeatedly divide the larger number by the smaller and replace the pair by (smaller, remainder) until the remainder becomes zero. The last non‑zero remainder is the gcd.
(i)PART I
Find ,16).Step 1 — FIRST DIVISION
Apply the division algorithm to and :
Hence .
Step 2 — SECOND DIVISION
Now divide by :
Thus .
Step 3 — THIRD DIVISION
Finally divide by :
Since the remainder is , the last non‑zero remainder is .
Therefore .
ANSWER (I)
,16)=4
(ii)PART II
Find ,12).Step 1 — FIRST DIVISION
Divide by :
Hence .
Step 2 — SECOND DIVISION
Divide by :
The remainder becomes , so the gcd is the last non‑zero remainder .
Thus .
ANSWER (II)
,12)=4
(iii)PART III
Find ,4).Step 1 — DIVISION STEP
Divide by :
Since the remainder is , the gcd is the divisor .
Hence .
ANSWER (III)
,4)=4
COMMON MISTAKES
- Forgetting to continue the Euclidean algorithm until the remainder becomes zero, leading to an incorrect gcd.
- Confusing the divisor with the remainder; the gcd is the last non‑zero remainder, not the first remainder.