Question

Use Euclid's division algorithm to find the HCF of
(i) 900 and 270 (ii) 196 and 38220 (ii) 1651 and 2032​

Answer 1

Explanation:

(i)900 and 270 , start with the larger

integer , that is 900. Apply the

Division lemma , we get

900=270×3+90

270=90×3+0

The remainder has now become

zero . Now our procedure stops.

Since the divisor at this stage is 90.

Therefore ,

HCF(900,270)=90

(ii) 38220 is higher than the 196, such that the smallest number is taken as divisor and the largest number is taken as dividend. Then by using the Euclid's algorithm, The finding of HCF of 196 and 38220 is solved in the below attachment. The quotient for by dividing 38220 by 196 is 195.

(iii) 2032 = 1651 × 1 + 381 . 381 = 127 × 3 + 0. Since the remainder becomes 0 here, so HCF of 1651 and 2032 is 127.