Question

explain eculids division lemma


i will make the answer as brainlyest
​

Answer 1

Answer: Euclid's Division Lemma: An Introduction. 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. The basis of the Euclidean division algorithm is Euclid's division lemma.

PLEASEE mark as me brainliest

Stay safe and work hard ✨