Question

Use Euclid's division algorithm to find the HCF of:
(i) 135 and 225

Answer 1

Since 225 > 135, we always divide the greater number by smaller one.
Divide 225 by 135, we get 1 quotient and 90 as remainder so that,
225 = 135 $\times$ 1 + 90
Divide 135 by 90, we get 1 quotient and 45 as remainder so that,
135 = 90 $\times$ 1 + 45
Divide 90 by 45, we get 2 quotient and no remainder, so we can write it as,
90 = 2 $\times$ 45 + 0
As there is no remainder, the divisor 45 is our HCF.