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

HCF of 7139, 5221 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 7139, 5221 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 7139, 5221 is 1.

HCF(7139, 5221) = 1

HCF of 7139, 5221 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 7139, 5221 is 1.

Highest Common Factor of 7139,5221 using Euclid's algorithm

Highest Common Factor of 7139,5221 is 1

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

7139 = 5221 x 1 + 1918

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

5221 = 1918 x 2 + 1385

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

1918 = 1385 x 1 + 533

We consider the new divisor 1385 and the new remainder 533,and apply the division lemma to get

1385 = 533 x 2 + 319

We consider the new divisor 533 and the new remainder 319,and apply the division lemma to get

533 = 319 x 1 + 214

We consider the new divisor 319 and the new remainder 214,and apply the division lemma to get

319 = 214 x 1 + 105

We consider the new divisor 214 and the new remainder 105,and apply the division lemma to get

214 = 105 x 2 + 4

We consider the new divisor 105 and the new remainder 4,and apply the division lemma to get

105 = 4 x 26 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(105,4) = HCF(214,105) = HCF(319,214) = HCF(533,319) = HCF(1385,533) = HCF(1918,1385) = HCF(5221,1918) = HCF(7139,5221) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 7139, 5221 using Euclid's Algorithm?

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