Question 1 (ii)
Use Euclid's division algorithm to find the HCF of:
(ii) 196 and 38220
Open in App
Solution
Since 38220 > 196 we always divide the greater number by smaller one.
Divide 38220 by 196, then we get quotient 195 and no remainder. So, we can write it as
38220 = 196 × 195 + 0
As there is no remainder, the divisor 196 is our HCF.