HCF of 258, 943, 851 using Euclid's algorithm

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

Here 943 is greater than 258

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

Step 1: Since 943 > 258, we apply the division lemma to 943 and 258, to get

943 = 258 x 3 + 169

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

258 = 169 x 1 + 89

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

169 = 89 x 1 + 80

We consider the new divisor 89 and the new remainder 80,and apply the division lemma to get

89 = 80 x 1 + 9

We consider the new divisor 80 and the new remainder 9,and apply the division lemma to get

80 = 9 x 8 + 8

We consider the new divisor 9 and the new remainder 8,and apply the division lemma to get

9 = 8 x 1 + 1

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

8 = 1 x 8 + 0

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

Notice that 1 = HCF(8,1) = HCF(9,8) = HCF(80,9) = HCF(89,80) = HCF(169,89) = HCF(258,169) = HCF(943,258) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Here 851 is greater than 1

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

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

851 = 1 x 851 + 0

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

Notice that 1 = HCF(851,1) .

Therefore, HCF of 258,943,851 using Euclid's division lemma is 1.