Question

Euclid’s division lemma states that for two 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

Correct answer is option (C) 0 ≤ r < b