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

Q2: (i) gcd⁡(825, 375)\gcd(825,\,375)    (ii) gcd⁡(375, 75)\gcd(375,\,75)    (iii) gcd⁡(16, 60)\gcd(16,\,60)    (iv) gcd⁡(12, 16)\gcd(12,\,16)    (v) gcd⁡(1, 4)\gcd(1,\,4)    (vi) gcd⁡(12, 3)\gcd(12,\,3)

UNDERSTAND THE QUESTION

  • We need to find the Greatest Common Divisor (GCD), also known as the Highest Common Factor (HCF), for six different pairs of integers using prime factorization or division method as taught in NCERT Class 9 Number Systems.
  • GCD (Greatest Common Divisor): The largest positive integer that divides each of the integers without leaving a remainder.

(i)PART I

gcd⁡(825\gcd(825, 375)

Step 1 — PRIME FACTORIZE 825

Using prime factorization for 825825:
825÷3=275275÷5=5555÷5=1111÷11=1\begin{aligned} 825 \div 3 &= 275 \\[0.6em] 275 \div 5 &= 55 \\[0.6em] 55 \div 5 &= 11 \\[0.6em] 11 \div 11 &= 1 \end{aligned}
So, the prime factorization of 825825 is 3×52×113 \times 5^2 \times 11.

Step 2 — PRIME FACTORIZE 375

Using prime factorization for 375375:
375÷3=125125÷5=2525÷5=55÷5=1\begin{aligned} 375 \div 3 &= 125 \\[0.6em] 125 \div 5 &= 25 \\[0.6em] 25 \div 5 &= 5 \\[0.6em] 5 \div 5 &= 1 \end{aligned}
So, the prime factorization of 375375 is 3×533 \times 5^3.

Step 3 — FIND THE GCD

The GCD is the product of the smallest powers of each common prime factor in the numbers.
GCD(825,375)=31×52=3×25=75\text{GCD}(825, 375) = 3^1 \times 5^2 = 3 \times 25 = 75

ANSWER (I)

7575

(ii)PART II

gcd⁡(375\gcd(375, 75)

Step 1 — PRIME FACTORIZE BOTH NUMBERS

From the previous part, the prime factorization of 375375 is 3×533 \times 5^3.
For 7575:
75÷3=2525÷5=55÷5=1\begin{aligned} 75 \div 3 &= 25 \\[0.6em] 25 \div 5 &= 5 \\[0.6em] 5 \div 5 &= 1 \end{aligned}
So, the prime factorization of 7575 is 3×523 \times 5^2.

Step 2 — FIND THE GCD

Taking the common prime factors with their lowest powers:
GCD(375,75)=31×52=3×25=75\text{GCD}(375, 75) = 3^1 \times 5^2 = 3 \times 25 = 75

ANSWER (II)

7575

(iii)PART III

gcd⁡(16\gcd(16, 60)

Step 1 — PRIME FACTORIZE BOTH NUMBERS

For 1616:
16=2416 = 2^4
For 6060:
60÷2=3030÷2=1515÷3=55÷5=1\begin{aligned} 60 \div 2 &= 30 \\[0.6em] 30 \div 2 &= 15 \\[0.6em] 15 \div 3 &= 5 \\[0.6em] 5 \div 5 &= 1 \end{aligned}
So, 60=22×3×560 = 2^2 \times 3 \times 5.

Step 2 — FIND THE GCD

The common prime factor is 22, and its lowest power present in both factorizations is 222^2.
GCD(16,60)=22=4\text{GCD}(16, 60) = 2^2 = 4

ANSWER (III)

44

(iv)PART IV

gcd⁡(12\gcd(12, 16)

Step 1 — PRIME FACTORIZE BOTH NUMBERS

For 1212:
12=22×312 = 2^2 \times 3
For 1616:
16=2416 = 2^4

Step 2 — FIND THE GCD

The common prime factor is 22, with the lowest power being 222^2.
GCD(12,16)=22=4\text{GCD}(12, 16) = 2^2 = 4

ANSWER (IV)

44

(v)PART V

gcd⁡(1\gcd(1, 4)

Step 1 — DETERMINE THE FACTORS

The factors of 11 are: 11
The factors of 44 are: 1,2,41, 2, 4

Step 2 — FIND THE GCD

The only common positive divisor between 11 and 44 is 11.
GCD(1,4)=1\text{GCD}(1, 4) = 1

ANSWER (V)

11

(vi)PART VI

gcd⁡(12\gcd(12, 3)

Step 1 — PRIME FACTORIZE BOTH NUMBERS

For 1212:
12=22×312 = 2^2 \times 3
For 33:
3=313 = 3^1

Step 2 — FIND THE GCD

The common prime factor is 33, with the lowest power being 313^1.
GCD(12,3)=3\text{GCD}(12, 3) = 3

ANSWER (VI)

33

COMMON MISTAKES

  • Taking Highest Powers Instead of Lowest: Confusing GCD with LCM and picking the highest exponents of prime factors.
  • Incomplete Factorization: Stopping prime factorization prematurely before reaching prime numbers.

Was this solution helpful?

Quick Concept Check: Test Your Understanding

Interactive self-testing widget

?
What is the GCD of 12 and 16?