4. Using Euclid’s division algorithm, find the HCF of
(i) 612 and 1314
(ii) 1260 and 7344
(iii) 4052 and 12576
4. Using Euclid’s division algorithm, find the HCF of
1 thought on “4. Using Euclid’s division algorithm, find the HCF of<br />(i) 612 and 1314<br />(ii) 1260 and 7344<br />(iii) 4052 and 12576”
Leave a Comment
You must be logged in to post a comment.
Answer:
Given find the HCF by using Euclid division Lemma of 612 and 1314.
Now remainder is zero and therefore b is the final step is 18 and so hcf of 612 and 1314 is 18.