Highest Common Factor of 348, 828, 844, 98 using Euclid's algorithm

Created By : Jatin Gogia

Reviewed By : Rajasekhar Valipishetty

Last Updated : Apr 06, 2023


HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 348, 828, 844, 98 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 348, 828, 844, 98 is 2 the largest number which exactly divides all the numbers i.e. where the remainder is zero. Let us get into the working of this example.

Consider we have numbers 348, 828, 844, 98 and we need to find the HCF of these numbers. To do so, we need to choose the largest integer first and then as per Euclid's Division Lemma a = bq + r where 0 ≤ r ≤ b

Highest common factor (HCF) of 348, 828, 844, 98 is 2.

HCF(348, 828, 844, 98) = 2

HCF of 348, 828, 844, 98 using Euclid's algorithm

Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

HCF of:

Highest common factor (HCF) of 348, 828, 844, 98 is 2.

Highest Common Factor of 348,828,844,98 using Euclid's algorithm

Highest Common Factor of 348,828,844,98 is 2

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

828 = 348 x 2 + 132

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

348 = 132 x 2 + 84

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

132 = 84 x 1 + 48

We consider the new divisor 84 and the new remainder 48,and apply the division lemma to get

84 = 48 x 1 + 36

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

48 = 36 x 1 + 12

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

36 = 12 x 3 + 0

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

Notice that 12 = HCF(36,12) = HCF(48,36) = HCF(84,48) = HCF(132,84) = HCF(348,132) = HCF(828,348) .


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

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

844 = 12 x 70 + 4

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

12 = 4 x 3 + 0

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

Notice that 4 = HCF(12,4) = HCF(844,12) .


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

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

98 = 4 x 24 + 2

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

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(98,4) .

HCF using Euclid's Algorithm Calculation Examples

Frequently Asked Questions on HCF of 348, 828, 844, 98 using Euclid's Algorithm

1. What is the Euclid division algorithm?

Answer: Euclid's Division Algorithm is a technique to compute the Highest Common Factor (HCF) of given positive integers.

2. what is the HCF of 348, 828, 844, 98?

Answer: HCF of 348, 828, 844, 98 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 348, 828, 844, 98 using Euclid's Algorithm?

Answer: For arbitrary numbers 348, 828, 844, 98 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.