Question

$\huge\color{cyan}\boxed{\colorbox{black}{Question ❤}}$

what do u means by Euclid's divisions algorithms ? ​

Answer 1

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."

Answer 2

Answer:

it says that if a is divided by b , then a = qb + r , where q is quotient and r is remainder . if a is divisible by b , then r = 0 and a/b = q , hope it helps you gorgeous