According to euclid's division algorithm HCF of any two positive integers a and b with a> b is obtained by applying euclid's division lemma to a and b to find q and r such that a = bq + r where r must satisfy
+3
Answers (1)
Know the Answer?
Not Sure About the Answer?
Find an answer to your question 👍 “According to euclid's division algorithm HCF of any two positive integers a and b with a> b is obtained by applying euclid's division lemma ...” in 📗 Mathematics if the answers seem to be not correct or there’s no answer. Try a smart search to find answers to similar questions.
Home » Mathematics » According to euclid's division algorithm HCF of any two positive integers a and b with a> b is obtained by applying euclid's division lemma to a and b to find q and r such that a = bq + r where r must satisfy