Question

State Euclid's division lemma

Answer 1

Euclid's Division Lemma: According to Euclid's Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r ≤ b. The basis of Euclidean division algorithm isEuclid's division lemma.

Answer 2

Given two positive integer 'a' and 'b' there exist Two unique integers q & r such that
a = bq + r where 0 _< r < b.