Question

what is equlid division lemma

Answer 1

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

Answer 2

The basis of Euclidean division algorithm isEuclid's division lemma. To calculate the Highest Common Factor (HCF) of two positive integers a and b we useEuclid's division algorithm. HCF is the largest number which exactly divides two or more positive integers.
Hope this helps