Home › CAT › Quantitative Aptitude › Number System › Euclid's algorithm works because HCF(c, d) equals:
Euclid's algorithm works because HCF(c, d) equals:
AHCF(c, r)
BHCF(q, r)
CHCF(c, q)
DHCF(d, r)
Answer & Solution
Correct answer: D. HCF(d, r)
1. Replace the pair with divisor and remainder.
2. The HCF does not change.
3. Repeat until the remainder is zero.
_Source: NCERT Class 10 Mathematics, Chapter 1, Real Numbers._
Related questions
Before applying any solving method, an equation must first be written in its:Which two methods of solving quadratic equations are worked through in the examples?Because 2401 is the square of 49, that equation has roots that are:A number of toys problem leads to 2x squared plus x minus 300 equals 0. Its discriminant iThe roots of a quadratic equation are the same as the zeroes of the corresponding:The values of x that satisfy a quadratic equation are called its:A method that rewrites the equation so one side becomes a perfect square is called:The roots of x squared plus 4x minus 5 equals 0 are: