HCF of 35, 42, 77, 98 using Euclid's algorithm

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

Here 42 is greater than 35

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

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

42 = 35 x 1 + 7

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

35 = 7 x 5 + 0

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

Notice that 7 = HCF(35,7) = HCF(42,35) .

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

Here 77 is greater than 7

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

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

77 = 7 x 11 + 0

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

Notice that 7 = HCF(77,7) .

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

Here 98 is greater than 7

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

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

98 = 7 x 14 + 0

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

Notice that 7 = HCF(98,7) .

Therefore, HCF of 35,42,77,98 using Euclid's division lemma is 7.