Question

Using Euclid’s division algorithm find the HCF of 105 and 250​

Answer 1

Answer:

5

Explanation:

hope this helps you for your answer

Answer 2

Answer:

5

Step-by-step explanation:

Here 250 is greater than 105

Now, consider the largest number as 'a' from the given number ie., 250 and 105 satisfy Euclid's division lemma statement a = bq + r where 0 ≤ r < b

Step 1: Since 250 > 105, we apply the division lemma to 250 and 105, to get

250 = 105 x 2 + 40

Step 2: Since the reminder 105 ≠ 0, we apply division lemma to 40 and 105, to get

105 = 40 x 2 + 25

Step 3: We consider the new divisor 40 and the new remainder 25, and apply the division lemma to get

40 = 25 x 1 + 15

We consider the new divisor 25 and the new remainder 15,and apply the division lemma to get

25 = 15 x 1 + 10

We consider the new divisor 15 and the new remainder 10,and apply the division lemma to get

15 = 10 x 1 + 5

We consider the new divisor 10 and the new remainder 5,and apply the division lemma to get

10 = 5 x 2 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 5, the HCF of 105 and 250 is 5