use Euclid'sdivison algorithm to find H.C.F of 125 and 32
Answers
Answered by
1
Answer:
HCF of Numbers 125,32 by Euclid's Division Lemma
Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(29,3) = HCF(32,29) = HCF(125,32) . Therefore, HCF of 125,32 using Euclid's division lemma is 1.
Similar questions