wiz-icon
MyQuestionIcon
MyQuestionIcon
2
You visited us 2 times! Enjoying our articles? Unlock Full Access!
Question

Euclid's division lemma states that for two positive integers a and b, there exist unique integers q and r such that a=bq+r, where r must satisfy

A
1 < r < b
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
0<rb
No worries! We‘ve got your back. Try BYJU‘S free classes today!
C
0r<b
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
D
0 < r < b
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is D 0r<b
If r must satisfy0r<b
Proof,
..,a3b,a2b,ab,a,a+b,a+2b,a+3b,..
clearly it is an arithmetic progression with common difference b and it extends infinitely in both directions.
Let r be the smallest non-negative term of this arithmetic progression.Then,there exists a non-negative integer q such that,
abq=r
=>a=bq+r
As,r is the smallest non-negative integer satisfying the result.Therefore, 0rb
Thus, we have
a=bq1+r1, 0r1b

flag
Suggest Corrections
thumbs-up
0
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Introduction
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon