Question

what is Euclid's division lemma?
-1 mark question

I will ask more 50 pointer questions. Stay tuned.​

Answer 1

Euclid's Division Algorithm or Lemma:

It is the process of dividing one integer by another, in such a way that produces a quotient and a remainder smaller than the divisor.

a=bq+r where 0<r<b.

itzDopeGirl

Answer 2

Answer:

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exist unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b.