Question

Find the hcf(121,573)by Euclid's algorithm

Answer 1

Euclid's algorithm is
a = bq + r
573 = 121 × 4 + 85
121 = 85 × 1 + 36
85 = 36 ×2 + 13
36 = 13 × 2 + 0
So hcf is 13
____hope it helps

Answer 2

Answer:

• The divisor at this stage, ie, 13 is the HCF of 121 and 573.

Given :

• The numbers 121 and 573.

To find :

• HCF of 121 and 573 by Euclid method =?

Step-by-step explanation:

Clearly, 573 > 121

Applying the Euclid's division lemma to 573 and 121, we get

573 = 121 x 4 + 85

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

121 = 85 x 1 + 36

We consider the new divisor 85 and remainder 36 and apply the division lemma to get

85 = 36 x 2 + 13

We consider the new divisor 36 and remainder 13 and apply the division lemma to get

36 = 13 x 2 + 0

Now, the remainder at this stage is 0.

So, the divisor at this stage, ie, 13 is the HCF of 121 and 573.