Question

1. Euclid's Division Lemma states that for two positive integers a and b there exists unique
integersg and r such that a= bq+r, wherer must satisfy: -
(a)1<r<b
(b) 0<rsb
(c) Osr<b
(d) 0<r<b​

Answer 1

Answer:

your answer is =

which satisfies the condition a = bq + r where 0 ≤ r < b.