Question

what is Euclid's Division Lemma?

Answer 1

Euclid's Division Lemma:
According to Euclid's Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of Euclidean division algorithm is Euclid's division lemma. 
    ;hope this answer would help u......

Answer 2

Hi friend ........ here's your answer......

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 division algorithm. HCF is the largest number which exactly divides two or more positive.

hope helps.........