Please help on solving this

if a is divided by b,b(# 0) is the divisor, q is quotient and r is remainder, then a=bq+r, where

Option:

(A) 0 ≤ r ≤  b (B) 0 ≥  r > b (C) 0 ≤  r < b (D) 0 < r < b

 

Dear Student!

Euclid's Division Lemma: Let a and b be any two positive integers.Then there exists unique integers q and r such that

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

Cheers!

  • 0

c)0<_r<b

rremainder may be 0 or may be more then it but b is not equall to 0 given and greater then r

  • 0

Thanks for your awnser I asked my teacher and your awnser is right. Could you explain it better because I didn't understand it properly.

  • 0
  • Good quation 
  • 0
What are you looking for?