Euclid's division lemma states that for positive integers a and b, there exist unique q and r such that:
- a = bq, with no remainder
- a = bq + r, where 0 ≤ r < b
- a = bq + r, where r > b
- a = b + qr
Show answer and solution
Correct answer: B. a = bq + r, where 0 ≤ r < b
Euclid's division lemma: a = bq + r with 0 ≤ r < b, and q, r unique.