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

HCF of 5486, 2109 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 5486, 2109 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 5486, 2109 is 1.

HCF(5486, 2109) = 1

HCF of 5486, 2109 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 5486, 2109 is 1.

Highest Common Factor of 5486,2109 using Euclid's algorithm

Highest Common Factor of 5486,2109 is 1

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

5486 = 2109 x 2 + 1268

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

2109 = 1268 x 1 + 841

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

1268 = 841 x 1 + 427

We consider the new divisor 841 and the new remainder 427,and apply the division lemma to get

841 = 427 x 1 + 414

We consider the new divisor 427 and the new remainder 414,and apply the division lemma to get

427 = 414 x 1 + 13

We consider the new divisor 414 and the new remainder 13,and apply the division lemma to get

414 = 13 x 31 + 11

We consider the new divisor 13 and the new remainder 11,and apply the division lemma to get

13 = 11 x 1 + 2

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

11 = 2 x 5 + 1

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 5486 and 2109 is 1

Notice that 1 = HCF(2,1) = HCF(11,2) = HCF(13,11) = HCF(414,13) = HCF(427,414) = HCF(841,427) = HCF(1268,841) = HCF(2109,1268) = HCF(5486,2109) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 5486, 2109 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 5486, 2109?

Answer: HCF of 5486, 2109 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5486, 2109 using Euclid's Algorithm?

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