Question

Euclid's division lemma sates that for any positive integers a and b, there exist unique integers q and r such that a = bq + r, where r must satisfy

(a) 1 < r < b
(b) 0 < r ≤ b
(c) 0 ≤ r < b
(d) 0 < r < b

Answer 1

(c) 0 ≤ r < b

Euclid's division lemma states that for any positive integers a and b, there exist unique integers q and r such that a = bq + r,
where r​ must satisfy 0 ≤ r < b