Home › CAT › Quantitative Aptitude › Number System › Euclid's division lemma: for positive integers a…
Euclid's division lemma: for positive integers a and b there exist unique integers q and r with a = bq + r and:
A0 <= r < b
B0 < r <= b
Cb <= r < a
Dr >= a > b
Answer & Solution
Correct answer: A. 0 <= r < b
1. The remainder is smaller than the divisor.
2. It can be zero.
3. So 0 is at most r, and r is less than b.
_Source: NCERT Class 10 Mathematics, Chapter 1, Real Numbers._
Related questions
Before applying any solving method, an equation must first be written in its:Which two methods of solving quadratic equations are worked through in the examples?Because 2401 is the square of 49, that equation has roots that are:A number of toys problem leads to 2x squared plus x minus 300 equals 0. Its discriminant iThe roots of a quadratic equation are the same as the zeroes of the corresponding:The values of x that satisfy a quadratic equation are called its:A method that rewrites the equation so one side becomes a perfect square is called:The roots of x squared plus 4x minus 5 equals 0 are: