Question

what is euclid division lemma?

Answer 1

Given positive integers a and b ,there eist unique pair of integers q and r ,satisfying a = bq+r,0 <r<b

Answer 2

Euclid's Division Lemma: ... The basis of Euclidean division algorithm is Euclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we use Euclid's divisionalgorithm. HCF is the largest number which exactly divides two or more positive integers