Highest Common Factor of 867, 537, 329, 155 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 867, 537, 329, 155 i.e. 1 the largest integer that leaves a remainder zero for all numbers.

HCF of 867, 537, 329, 155 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 867, 537, 329, 155 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 867, 537, 329, 155 is 1.

HCF(867, 537, 329, 155) = 1

HCF of 867, 537, 329, 155 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 867, 537, 329, 155 is 1.

Highest Common Factor of 867,537,329,155 using Euclid's algorithm

Highest Common Factor of 867,537,329,155 is 1

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

867 = 537 x 1 + 330

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

537 = 330 x 1 + 207

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

330 = 207 x 1 + 123

We consider the new divisor 207 and the new remainder 123,and apply the division lemma to get

207 = 123 x 1 + 84

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

123 = 84 x 1 + 39

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

84 = 39 x 2 + 6

We consider the new divisor 39 and the new remainder 6,and apply the division lemma to get

39 = 6 x 6 + 3

We consider the new divisor 6 and the new remainder 3,and apply the division lemma to get

6 = 3 x 2 + 0

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

Notice that 3 = HCF(6,3) = HCF(39,6) = HCF(84,39) = HCF(123,84) = HCF(207,123) = HCF(330,207) = HCF(537,330) = HCF(867,537) .

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

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

329 = 3 x 109 + 2

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

3 = 2 x 1 + 1

Step 3: We consider the new divisor 2 and the new remainder 1, and apply the division lemma 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 3 and 329 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(329,3) .

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

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

155 = 1 x 155 + 0

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

Notice that 1 = HCF(155,1) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 867, 537, 329, 155 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 867, 537, 329, 155?

Answer: HCF of 867, 537, 329, 155 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 867, 537, 329, 155 using Euclid's Algorithm?

Answer: For arbitrary numbers 867, 537, 329, 155 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.