Write the statement of Ecluids division algorithm
Answers
Answered by
1
Answer:
Euclid's division algorithm is a way to find the HCF of two numbers by using Euclid's division lemma. It states that if there are any two integers a and b, there exists q and r such that it satisfies the given condition a = bq + r where 0 ≤ r < b.
Answered by
0
Answer:
Euclid's division lemma is a formula where we can find the HCF of 2 number through a = bq + r where a is the larger number, b is the smaller number, q is the quotient and r is the remainder. we continue this formula until r is 0. then we write the obtained lowest smaller as the hcf
Similar questions