Respuesta :

Answer:

10

Step-by-step 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.

semsee45

Answer:

10

Step-by-step 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

Otras preguntas