Question

Use Euclid's Divison Algorithum to find the H.C.F of 12560 & 215​

Answer 1

Answer:

to find the hcf of 12560 and 215 : we will apply the Euclid's lemma a = bq+ r, where r is the remainder. thus hcf of 12560 and 215 is 5.