Question

Find the HCF of 700 and 280 by Euclid's algorithm?

A)Divide the larger number (700) by the smaller number (280).
B)The quotient is 2, and the remainder is 140.
C)Now, divide 280 by the remainder, which is 140.
D)The quotient is 2, and the remainder is 0.

Answer 1

To find the HCF of 700 and 280 using Euclid's algorithm, divide and find the remainders until the remainder is 0. The HCF is the last non-zero remainder.

Step-by-step explanation:

To find the HCF (Highest Common Factor) of 700 and 280 using Euclid's algorithm, follow these steps:

1. Divide the larger number (700) by the smaller number (280).
2. The quotient is 2, and the remainder is 140.
3. Now, divide 280 by the remainder, which is 140.
4. The quotient is 2, and the remainder is 0.

Therefore, the HCF of 700 and 280 is 140.