Ex 1.1 Class 10 Math Q1(i)- Use Euclid's Division Algorithm to find the HCF of 135 and 225

 Question1. Use Euclid’s division algorithm to find the HCF of :

 (i) 135 and 225 (ii) 196 and 38220 (iii) 867 and 255

Solution:  

(i) First we have to compare numbers as 225 > 135 then 135 is the divisor and 225 is the dividend.

Therefore, a/c to Euclid's division algorithm, 

225 = 135 x 1 + 90

Since 90 is not equal to 0

Now, 90 is divisor and 135 is dividend

A/c to Euclid's division algorithm,

135 = 90 x 1 + 45

Since 45 is not equal to 0, we will continue dividing till we get 0 as reminder

As the remainder is zero, we can stop dividing now. In this last step 45 is the divisor.

Therefore, the HCF of 225 and 135 is 45.