Question

Fill in the blanks: 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 _________.* 1️⃣ 1 < r < b 2️⃣ 0 < r b 3️⃣ 0 r < b 4️⃣ 0< r < b​

Answer 1

Answer:

its option 4. 0 <r <b

Step-by-step explanation:

0 is less than r and r is less than b