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

HCF of 5858, 5302, 39209 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 5858, 5302, 39209 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 5858, 5302, 39209 is 1.

HCF(5858, 5302, 39209) = 1

HCF of 5858, 5302, 39209 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 5858, 5302, 39209 is 1.

Highest Common Factor of 5858,5302,39209 using Euclid's algorithm

Highest Common Factor of 5858,5302,39209 is 1

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

5858 = 5302 x 1 + 556

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

5302 = 556 x 9 + 298

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

556 = 298 x 1 + 258

We consider the new divisor 298 and the new remainder 258,and apply the division lemma to get

298 = 258 x 1 + 40

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

258 = 40 x 6 + 18

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

40 = 18 x 2 + 4

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

18 = 4 x 4 + 2

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

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(18,4) = HCF(40,18) = HCF(258,40) = HCF(298,258) = HCF(556,298) = HCF(5302,556) = HCF(5858,5302) .

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

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

39209 = 2 x 19604 + 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 39209 is 1

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

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 5858, 5302, 39209 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 5858, 5302, 39209?

Answer: HCF of 5858, 5302, 39209 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5858, 5302, 39209 using Euclid's Algorithm?

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