The HCF of 455 and 42, found by Euclid's algorithm, is:
A3
B9
C7
D5
Answer & Solution
Correct answer: C. 7
1. 455 is 42 times 10 plus 35.
2. 42 is 35 times 1 plus 7, and 35 is 7 times 5.
3. The last divisor, 7, is the HCF.
_Source: syllabus Mathematics, Chapter 1, Real Numbers._
Keep practising Number System
Browse all Number System questions for CAT, or explore more Quantitative Aptitude topics.