Use Euclid's division algorithm to find the HCF of:
(i) 225 > 135 we always divide greater number with smaller one.
Divide 225 by 135 we get 1 quotient and 90 as remainder so that
225= 135 × 1 + 90
Divide 135 by 90 we get 1 quotient and 45 as remainder so that
135= 90 × 1 + 45
Divide 90 by 45 we get 2 quotient and no remainder so we can write it as
90 = 2 × 45+ 0
As there are no remainder so divisor 45 is our HCF.
(ii) 38220 > 196 we always divide greater number with smaller one.