Question

find HCF of 50 and 70 using euclid's division Lemma​

Answer 1

Answer:

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.

Answer 2

Given: Two numbers-  50 and 70

To find: HCF of given numbers using Euclid's Division Lemma

Solution:

(Definition - According to Euclid's division lemma, if we have two positive integers a and b, then there exist unique integers q an r which satisfies the condition a = bq + r where 0 ≤ r < b)

The larger integer is 70 and smaller is 50

We need to apply Euclid's Division Lemma (a = bq + r) on the given numbers where a = 70 and b = 50.

We get,

⇒ 70 = 50 × 1 + 20

Now, we need to apply Euclid's Division Lemma again taking a = 50 and b = 20

⇒ 50 = 20 × 2 + 10

Taking a = 20 and b = 10

⇒ 20 = 10 × 2 + 0

As the remainder has become 0, we can't proceed further.

Now, the divisor is 10 when remainder is 0.

Hence, 10 is the HCF of 50 and 70.