Q2: (i) (ii) (iii) (iv) (v) (vi)
SOLUTION
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
, 375)Step 1 — PRIME FACTORIZE 825
Using prime factorization for :
So, the prime factorization of is .
Step 2 — PRIME FACTORIZE 375
Using prime factorization for :
So, the prime factorization of is .
Step 3 — FIND THE GCD
The GCD is the product of the smallest powers of each common prime factor in the numbers.
ANSWER (I)
(ii)PART II
, 75)Step 1 — PRIME FACTORIZE BOTH NUMBERS
From the previous part, the prime factorization of is .
For :
So, the prime factorization of is .
Step 2 — FIND THE GCD
Taking the common prime factors with their lowest powers:
ANSWER (II)
(iii)PART III
, 60)Step 1 — PRIME FACTORIZE BOTH NUMBERS
For :
For :
So, .
Step 2 — FIND THE GCD
The common prime factor is , and its lowest power present in both factorizations is .
ANSWER (III)
(iv)PART IV
, 16)Step 1 — PRIME FACTORIZE BOTH NUMBERS
For :
For :
Step 2 — FIND THE GCD
The common prime factor is , with the lowest power being .
ANSWER (IV)
(v)PART V
, 4)Step 1 — DETERMINE THE FACTORS
The factors of are:
The factors of are:
Step 2 — FIND THE GCD
The only common positive divisor between and is .
ANSWER (V)
(vi)PART VI
, 3)Step 1 — PRIME FACTORIZE BOTH NUMBERS
For :
For :
Step 2 — FIND THE GCD
The common prime factor is , with the lowest power being .
ANSWER (VI)
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.