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

Explain division of algorithms of lemma In real number

Open in App
Solution

Euclid's Division Lemma:
According to Euclid's Division Lemma if we have two positive integers a and b, then there exists unique integers q and r which satisfies the condition a = bq + r where 0rb.
This algorithm is basically your division algorithm. In division we know that
"Dividend = Division*Quotient + Remainder"
Here a - Dividend, b - Divisor, q - Quotient and r - Remainder.

flag
Suggest Corrections
thumbs-up
1
Join BYJU'S Learning Program
similar_icon
Related Videos
thumbnail
lock
Ones with the One and the Others
MATHEMATICS
Watch in App
Join BYJU'S Learning Program
CrossIcon