-lock-
-endlock-
Euclid's Division Algorithm
Last updated at August 14, 2026 by Teachoo
-lock-
-endlock-
Transcript
Ex 1.1 , 1 Use Euclid’s division algorithm to find the HCF of : (ii) 196 and 38220 Since 38220 > 196 We divide 38220 by 196 Since remainder is 0 HCF of 196 and 38220 is 196