Question

what is euclid division lemma

Answer 1

Euclid's Division Lemma: ... The basis of Euclidean division algorithm isEuclid'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....
May it helps ....

Answer 2

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 .

Eg

If we have two integers a=27 and b=4

Then 27= 4×6 + 3,

Where q= 6 and r= 3(less than b=4) are also integers.