Question

Find H.C.F of 1405 and 1465 by Euclid’s division algorithm(Please Give me correct answer)​

Answer 1

Answer:

The smallest number among 1405, 1465 and 1530 is 1405. We know that 1405 is greater than 5. So, we can say that 5 is the H.C.F of 1405, 1465 and 1530

Answer 2

EXPLANATION.

H.C.F of 1405 and 1465 by Euclid's division algorithm.

As we know that,

We can write equation as,

⇒ 1465 = 1405 + 60.

⇒ 1405 = 60 x 23 + 25.

⇒ 60 = 25 x 2 + 10.

⇒ 10 = 2 x 5 + 0.

As we can see that,

The H.C.F of 1405 and 1465 = 5.