what Euclid's division algorithm...???
Answers
Answered by
6
Answer:
So, according to Euclid's Division Lemma, if we have two positive integers a and b, then there would be whole numbers q and r that satisfy the equation: a = bq + r, where 0 ≤ r < b. ... q is the quotient and r is the remainder. By using this lemma, we can find the HCF of two numbers.
Answered by
2
Answer:
So, according to Euclid's Division Lemma, if we have two positive integers a and b, then there would be whole numbers q and r that satisfy the equation: a = bq + r, where 0 ≤ r < b. ... q is the quotient and r is the remainder. By using this lemma, we can find the HCF of two numbers.
Similar questions