find the HCF by euclid's diviaion lemma 8232and5313
Answers
Answered by
0
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. Let's learn more about it in this lesson.
Answered by
0
Answer:
hope you got the answer!!
Attachments:
Similar questions