Question

Euclid's division lemma states that if a and b are any two positive integers then there exist unique integers q and r such that -
i) a = bq + r , 0 < r < b ii) a = bq + r , 0 < r < b
iii) a = bq + r , 0 < r < b iv) a = bq + r , 0 < b < r​

Answer 1

Answer:

a= bq+r , 0 less or equal to r and r less than b