NEWAll India NCERT Mock Test Series is now live!Take Free Test
| Exercise 11.3

Q3: (i) Find gcd⁡(60,16)\gcd(60,16). (ii) Find gcd⁡(16,12)\gcd(16,12). (iii) Find gcd⁡(12,4)\gcd(12,4).

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 gcd⁡(60\gcd(60,16).

Step 1 — FIRST DIVISION

Apply the division algorithm to 6060 and 1616:
60=16×3+12\begin{aligned} 60 &= 16\times 3 + 12 \end{aligned}
Hence gcd⁡(60,16)=gcd⁡(16,12)\gcd(60,16)=\gcd(16,12).

Step 2 — SECOND DIVISION

Now divide 1616 by 1212:
16=12×1+4\begin{aligned} 16 &= 12\times 1 + 4 \end{aligned}
Thus gcd⁡(16,12)=gcd⁡(12,4)\gcd(16,12)=\gcd(12,4).

Step 3 — THIRD DIVISION

Finally divide 1212 by 44:
12=4×3+0\begin{aligned} 12 &= 4\times 3 + 0 \end{aligned}
Since the remainder is 00, the last non‑zero remainder is 44.
Therefore gcd⁡(60,16)=4\gcd(60,16)=4.

ANSWER (I)

gcd⁡(60\gcd(60,16)=4

(ii)PART II

Find gcd⁡(16\gcd(16,12).

Step 1 — FIRST DIVISION

Divide 1616 by 1212:
16=12×1+4\begin{aligned} 16 &= 12\times 1 + 4 \end{aligned}
Hence gcd⁡(16,12)=gcd⁡(12,4)\gcd(16,12)=\gcd(12,4).

Step 2 — SECOND DIVISION

Divide 1212 by 44:
12=4×3+0\begin{aligned} 12 &= 4\times 3 + 0 \end{aligned}
The remainder becomes 00, so the gcd is the last non‑zero remainder 44.
Thus gcd⁡(16,12)=4\gcd(16,12)=4.

ANSWER (II)

gcd⁡(16\gcd(16,12)=4

(iii)PART III

Find gcd⁡(12\gcd(12,4).

Step 1 — DIVISION STEP

Divide 1212 by 44:
12=4×3+0\begin{aligned} 12 &= 4\times 3 + 0 \end{aligned}
Since the remainder is 00, the gcd is the divisor 44.
Hence gcd⁡(12,4)=4\gcd(12,4)=4.

ANSWER (III)

gcd⁡(12\gcd(12,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.

Was this solution helpful?