Question

Euclid's Division Lemma states that for any two positive integers a and b, there exist unique integers q and r, such that a = bq + r, where
(a) 0 < r < b
(b) 0 ≤ r < b
(c) 0 < r ≤ b
(d) 1 < r < b

Answer 1

(b) 0 ≤ r < b
On dividing a by b, let q be the quotient and r be the remainder.
Then, we have:
a = bq + r, where 0 ≤ r < b