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?
​

Answer 1

$<font color=green>$

❤. a = bq + r

$\bf\red{Where~, }$

r $\arrow\blue$ 0 ≤ r < b

r is the remainder .

$<marquee scrollamount=1200>justLUCKY❤>$