Question

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

Answer 1

Step-by-step explanation:

( i )900= 270 X 3+90

⟹270= 90 X 3+0

So , 90 is HCF of 900 & 270

( ii ) 38220= 196 X 195+0

So , 196 is HCF of 38220 & 196

( iii )2032= 1651 X 1+381

⟹1651=381 X 4+127

⟹381= 127 X 3+0

So 127 is HCF of 2032 & 1651

Answer 2

Step-by-step explanation:

we find hcf with the help of Euclid division lemma and this process is called Euclid division algorithm. we till divide numbers that remainder become not zero. hope you understand