Question

Euclid's division lemma states that if a and b are any +ve integers,
then the exist unique integers q and r such that
options are

a =bq+r;o<r<b
a =bq+r;o r <b
a =bq+r;o r<b
a =bq +r;o<b<r​

Answer 1

Answer:

a =bq +r; o<r <b is the right answer