What is eculid's division lemma
Answers
Answered by
0
Answer:
plz check it carefully. the statement is wrong
Answered by
2
Explanation:
a=bq+r, 0<r<b.
Given positive integer a and b there exist a unique integers q and r satisfying the above equation.
Euclid 's division algorithm is based on this lemma. It is a technique to compute the highest common factor of two given positive integer.
Hope it help..
Similar questions