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

पर्याय

• 1 < r < b

• 0 < r ≤ b

• 0 ≤ r < b

• 0 < r < b

Answer 1

0 ≤ r < b

Explanation:

On dividing a by b, let q be the quotient and r be the remainder.

Then, we have a = bq + r, where 0 ≤ r < b.