In Euclid's Division Algorithm, if the remainder is zero, then the divisor at that stage will be the ____.

sum of the numbers

No worries! We‘ve got your back. Try BYJU‘S free classes today!

product of the numbers

No worries! We‘ve got your back. Try BYJU‘S free classes today!

HCF

Right on! Give the BNAT exam to get a 100% scholarship for BYJUS courses

LCM

No worries! We‘ve got your back. Try BYJU‘S free classes today!

Open in App

Solution

The correct option is C HCF

Suggest Corrections

Similar questions

Q. In Euclid's Division Algorithm, if the remainder is zero, then the divisor at that stage will be the .

Q. If we apply Euclid"s division algorithm for

20

using

8

then the correct answer will be:

In division algorithm when should be stop the division process?
1. When the remainder is zero.
2. When the degree of the remainder is less than the degree of the divisor.
3. When the degree of the quotient is less than the degree of the divisor.

Q. In a question on division if four times the divisor is added to the dividend then how will the new remainder change in comparison with the original remainder?

Q. Verify the division algorithm for divident =

2 x^{2} + 3 x + 1

, divisor=

(x - 2)

,remainder

= 15

,quotient

= 2 x + 7

Join BYJU'S Learning Program