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

According to Euclid's division lemma, the remainder has to be the divisor.

A
greater than
No worries! We‘ve got your back. Try BYJU‘S free classes today!
B
lesser than
Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses
C
equal to
No worries! We‘ve got your back. Try BYJU‘S free classes today!
Open in App
Solution

The correct option is B lesser than
Euclid's division lemma states that, given positive integers a and b, there exist unique integers q and r satisfying a=b×q+r, where 0r<b. Here, a is the dividend, b is the divisor, q is the quotient and r is the remainder.

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