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

HCF of 2179, 8399, 11469 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 2179, 8399, 11469 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 2179, 8399, 11469 is 1.

HCF(2179, 8399, 11469) = 1

HCF of 2179, 8399, 11469 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 2179, 8399, 11469 is 1.

Highest Common Factor of 2179,8399,11469 using Euclid's algorithm

Highest Common Factor of 2179,8399,11469 is 1

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

8399 = 2179 x 3 + 1862

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

2179 = 1862 x 1 + 317

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

1862 = 317 x 5 + 277

We consider the new divisor 317 and the new remainder 277,and apply the division lemma to get

317 = 277 x 1 + 40

We consider the new divisor 277 and the new remainder 40,and apply the division lemma to get

277 = 40 x 6 + 37

We consider the new divisor 40 and the new remainder 37,and apply the division lemma to get

40 = 37 x 1 + 3

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

37 = 3 x 12 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(37,3) = HCF(40,37) = HCF(277,40) = HCF(317,277) = HCF(1862,317) = HCF(2179,1862) = HCF(8399,2179) .


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

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

11469 = 1 x 11469 + 0

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

Notice that 1 = HCF(11469,1) .

HCF using Euclid's Algorithm Calculation Examples

Frequently Asked Questions on HCF of 2179, 8399, 11469 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 2179, 8399, 11469?

Answer: HCF of 2179, 8399, 11469 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2179, 8399, 11469 using Euclid's Algorithm?

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