Question

Define euclid's division lemma

Answer 1

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 integers.

Answer 2

given positive integers 'a' and 'b', there exists unique integers 'q' and 'r' such that :a = bq + r , where 0≤ r < b.