35.1k views
4 votes
Find the HCF of 50and70 by using euclids algorithm​

User Reixa
by
7.6k points

2 Answers

11 votes

Answer:

10

Explanation:

To find,

HCF of 50 & 70 using Euclid's Division Algorithm.

Solution,

HCF(50 & 70) -- 70 = 50 × 1 + 20.

50 = 20 × 2 + 10

20 = 10 × 2 + 0.

Therefore their HCF is 10.

User David Gausmann
by
8.6k points
6 votes

Answer:

10

Explanation:

According to Euclid's Algorithm, c = dq + r , 0 ≤ r < d (where r is the remainder)

As 70 > 50, c = 70 and d = 50

Substituting values of c and d:

70 = (50 x 1) + 20

⇒ 50 = (20 x 2) + 10

⇒ 20 = (10 x 2) + 0

Therefore, the HCF is 10

User Kevin Robatel
by
7.9k points
Welcome to QAmmunity.org, where you can ask questions and receive answers from other members of our community.

9.4m questions

12.2m answers

Categories