Question

what is Euclid's division lemma?​

Answer 1

Answer:

$\huge\mathtt{\fcolorbox{cyan}{black}{\pink{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. The basis of the Euclidean division algorithm is Euclid's division lemma.

__________________

# Learn more:-

A method of finding the greatest common divisor of two numbers by dividing the larger by the smaller the smaller by the remainder, the first remainder by the second remainder, and so on until exact division is obtained whence the greatest common divisor is the exact divisor.

-----------------------------------

l Hope It's Helps You

-----------------------------------