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 $\le$ b (c) 0 $\le$ r < b (d) 0 < r < b r

Answer 1

Euclid's division lemma states that for two positive integers a and b, there exists unique integers q and r such that a = bq + r, where r must satisfy $0\le r<b$.

Hence, the correct answer is option C.