0Question 1
Use Euclid's division algorithm to find the HCF of
1)135 and 225
Since 225>135 we apply the division lemma to 225 and 135 to obtain
225= 135×1+90
Since r is not equal to 0
135=90×1+45
Since r is not equal to 0
90= 2×45+0
When remainder becomes zero,the process stops ,since the divisor at this stage is 45
Therefore HCF of 135 and 225 is 45.
