Question

13. Q- 10 In Euclid's division algorithm a =
bq+r wherer must satisfy
(1 Point)
1<r<b
0 <r<b
a <r <b
0 <r < b​

Answer 1

Answer:

$0 \leqslant r < b$

a = dividend

b = divisor

q = quotient

r = remainder

Hope it helps u