What is Euclid's Divison Lemma?
Answers
Answered by
1
Answer:
Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. HCF of two positive integers a and b is the largest positive integer d that divides both a and b
Answered by
0
Answer:
it states that for any two positive integers a and b
can u understand
Similar questions