HCF of 902, 1394, 3321 using Euclid's algorithm

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

Here 1394 is greater than 902

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

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

1394 = 902 x 1 + 492

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

902 = 492 x 1 + 410

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

492 = 410 x 1 + 82

We consider the new divisor 410 and the new remainder 82, and apply the division lemma to get

410 = 82 x 5 + 0

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

Notice that 82 = HCF(410,82) = HCF(492,410) = HCF(902,492) = HCF(1394,902) .

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

Here 3321 is greater than 82

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

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

3321 = 82 x 40 + 41

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

82 = 41 x 2 + 0

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

Notice that 41 = HCF(82,41) = HCF(3321,82) .

Therefore, HCF of 902,1394,3321 using Euclid's division lemma is 41.