Start learning →

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: syllabus Mathematics, Chapter 1, Real Numbers._
Practise this question with Quill — CAT →

Keep practising Number System

Browse all Number System questions for CAT, or explore more Quantitative Aptitude topics.

Start a Number System lesson →