Question

using euclid's division algorithm find the HCF of 2160 and 3520

Answer 1

answer is 80
answer 80

Answer 2

Answer:

The HCF of 3520 and 2160 by using Euclid's division algorithm is 80.

Step-by-step explanation:

Euclid’s division lemma, states that:

For any two positive integers ‘a’ and ‘b’ we can find two whole numbers ‘q’ and ‘r’ such that a = b × q + r where 0 ≤ r < b.

Solving by using Euclid's Division Algorithm:

3520 = 2160 * 1 + 1360

2160 = 1360 * 1 + 800

1360 = 800 * 1 + 560

800 = 560 * 1 + 240

560 = 240 * 2 + 80

240 = 80 * 3 + 0

Therefore, the HCF of 3520 and 2160 by using Euclid's division algorithm is 80.