Question

Euclid division algorithm use find hcf of 726 and 275​

Answer 1

Given :

• 726 and 275

To find :

• H. C. F of 726 and 275 by Euclid division algorithm.

Step-by-step explanation:

Clearly, 726 > 275

Applying the Euclid's division lemma to 726 and 275, we get

726 = 275 ×2 + 176

Since the remainder 176 ≠ 0, we apply the Euclid's division lemma to divisor 275 and remainder 176 to get

275 = 176 ×1 + 99

We consider the new divisor 176 and remainder 99 and apply the division lemma to get

176 = 99 ×1+77

We consider the new divisor 99 and remainder 77 and apply the division lemma to get

99 = 77 × 1+22

We consider the new divisor 77 and remainder 22 and apply the division lemma to get

77= 22 ×3 + 11

We consider the new divisor 22 and remainder 11 and apply the division lemma to get

22 = 11 × 2 + 0

Now, the remainder at this stage is 0.

So, the divisor at this stage, ie, 11 is the HCF of 726 and 275.

Answer 2

Answer:

Euclid's Division algorithm:

Euclids Division Algorithm is a technique to compute the Highest Common Factor (HCF) of two given positive integers. We have the formula = a = bq + r.

To Find:

We need to find the HCF of 726 and 275 by Euclid's Division algorithm.

Clearly 726 > 275

Division in attachment.

726 = 275 × 2 + 176

275 = 176 × 1 + 99

176 = 99 × 1 + 77

99 = 77 × 1 + 22

77 = 22 × 3 + 11

22 = 11 × 2 + 0

Therefore the HCF of 726 and 275 is 11.