MyQuestionIcon

1

You visited us 1 times! Enjoying our articles? Unlock Full Access!

Euclid's Division Algorithm

why remainder...

Question

why remainder is always less than divisor ? prove it using euclids division lemma.

Open in App

Solution

Suggest Corrections

thumbs-up

0

Similar questions

In polynomial division , the degree of the remainder is always ___ ( greater / less ) than the degree of the divisor.

Q. Find the HCF of 15 and 18 using Euclids Division Lemma.

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

Q. The degree of the remainder is always less than the degree of the divisor.

Q. Explain Euclids division lemma

View More

Join BYJU'S Learning Program

similar_icon

Related Videos

lock

Euclid's Division Algorithm_Tackle

MATHEMATICS

Watch in App

explore_more_icon

Explore more

Euclid's Division Algorithm

Standard X Mathematics

Join BYJU'S Learning Program

CrossIcon