Concept: The Highest Common Factor (HCF), also known as the Greatest Common Divisor (GCD), of two or more integers is the largest positive integer that divides each of the integers without a remainder. We can find the HCF using prime factorization or the Euclidean algorithm. Method 1: Prime Factorization Step 1: Find the prime factorization of 96
Step 2: Find the prime factorization of 404
Since 101 is a prime number (it is not divisible by any prime numbers less than or equal to , i.e., 2, 3, 5, 7),
Step 3: Identify common prime factors and their lowest powers
The common prime factor is 2.
The lowest power of 2 present in both factorizations is .
(3 is a factor of 96 but not 404. 101 is a factor of 404 but not 96). Step 4: Calculate the HCF
HCF = Product of common prime factors raised to their lowest powers.
HCF = . Method 2: Euclidean Algorithm
Step 1: Divide the larger number by the smaller number and find the remainder.
(Since , remainder is ) Step 2: Replace the larger number with the smaller number and the smaller number with the remainder, and repeat the division.
Now divide 96 by 20.
Step 3: Repeat the process.
Now divide 20 by 16.
Step 4: Repeat the process.
Now divide 16 by 4.
The last non-zero remainder is the HCF.
HCF = 4. Both methods give HCF = 4. This matches option (2).