In the division algorithm a=bq+ra = bq + ra=bq+r, what is the significance of the constraint 0≤r<b0 \le r < b0≤r<b?
It ensures both qqq and rrr must be positive integers
It ensures the remainder is smaller than the divisor and non-negative
It allows multiple representations of aaa in the form bq+rbq + rbq+r
It prevents the remainder from equaling the divisor