Question

Explain euclid division lemma

Answer 1

Euclid Division Lemma

it'ss given that 2 integers a and b there included 2 more integers q and r such that a=bq+r where b > r >=0.

I hope it will help u

Answer 2

the base of Euclidean division algorithm is Euclid division lemma .To calculate the highest common factor of two positive integer a and b we use Euclid's division algorithm .HCF is a largest number which exactly divides to earn more positive integer .

please mark this answer as a brainliest.