Home › CAT › Quantitative Aptitude › Number System › The HCF of 455 and 42, found by Euclid's algorit…
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: 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: