What is Euclid’s Division Lemma?
According to Euclid’s division Lemma, for two positive integers, a and b, there exists a unique integer such that a = bq + r, where 0 ≤ r < b. Where a is a dividend, b is a divisor, q is a quotient, and r is the remainder. The lemma is always equivalent to: Dividend = Divisor × Quotient + Remainder.