Question

in Euclid division Lemma is less than B and a is equal to b q + r ​

Answer 1

Answer:

a=bq+r

0 ≤ r ≤ b

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

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.