Question

The solution is blank in this question "

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

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

Please sort this for me

Answer 1

According to Euclid’s Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0 ≤ r <b.

Hence answer is c