Highest Common Factor of 158, 138, 91, 328 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 158, 138, 91, 328 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 158, 138, 91, 328 is 1 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 158, 138, 91, 328 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 158, 138, 91, 328 is 1.

HCF(158, 138, 91, 328) = 1

HCF of 158, 138, 91, 328 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 158, 138, 91, 328 is 1.

Highest Common Factor of 158,138,91,328 using Euclid's algorithm

Highest Common Factor of 158,138,91,328 is 1

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

158 = 138 x 1 + 20

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

138 = 20 x 6 + 18

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

20 = 18 x 1 + 2

We consider the new divisor 18 and the new remainder 2, and apply the division lemma to get

18 = 2 x 9 + 0

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

Notice that 2 = HCF(18,2) = HCF(20,18) = HCF(138,20) = HCF(158,138) .


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

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

91 = 2 x 45 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(91,2) .


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

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

328 = 1 x 328 + 0

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

Notice that 1 = HCF(328,1) .

HCF using Euclid's Algorithm Calculation Examples

Frequently Asked Questions on HCF of 158, 138, 91, 328 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 158, 138, 91, 328?

Answer: HCF of 158, 138, 91, 328 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 158, 138, 91, 328 using Euclid's Algorithm?

Answer: For arbitrary numbers 158, 138, 91, 328 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.