1
Question
Euclid’s division lemma states “Given positive integers a and b, there exist unique integers q and r satisfying a=bq+r".
Which of the following is true for r?
Euclid’s division lemma states “Given positive integers a and b, there exist unique integers q and r satisfying a=bq+r".
Which of the following is true for r?
Open in App
Solution
The correct option is C 0≤r<b
Euclid's Division Lemma:
Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r where 0≤r<b.
It can be observed that remainder can never be more than the divisor and is a non-negative integer (could be zero).
0≤r<b
Euclid's Division Lemma:
Given positive integers a and b, there exist unique integers q and r satisfying a = bq + r where 0≤r<b.
It can be observed that remainder can never be more than the divisor and is a non-negative integer (could be zero).
Suggest Corrections
0
Similar questions
Join BYJU'S Learning Program
Explore more
Join BYJU'S Learning Program
