HCF of 121, 573 using Euclid's algorithm

Below detailed show work will make you learn how to find HCF of 121,573 using the Euclidean division algorithm. So, follow the step by step explanation & check the answer for HCF(121,573).

Here 573 is greater than 121

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

Step 1: Since 573 > 121, we apply the division lemma to 573 and 121, to get

573 = 121 x 4 + 89

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

121 = 89 x 1 + 32

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

89 = 32 x 2 + 25

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

32 = 25 x 1 + 7

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

25 = 7 x 3 + 4

We consider the new divisor 7 and the new remainder 4,and apply the division lemma to get

7 = 4 x 1 + 3

We consider the new divisor 4 and the new remainder 3,and apply the division lemma to get

4 = 3 x 1 + 1

We consider the new divisor 3 and the new remainder 1,and apply the division lemma to get

3 = 1 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 121 and 573 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(25,7) = HCF(32,25) = HCF(89,32) = HCF(121,89) = HCF(573,121) .

Therefore, HCF of 121,573 using Euclid's division lemma is 1.