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

HCF of 5158, 9353, 39878 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 5158, 9353, 39878 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 5158, 9353, 39878 is 1.

HCF(5158, 9353, 39878) = 1

HCF of 5158, 9353, 39878 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 5158, 9353, 39878 is 1.

Highest Common Factor of 5158,9353,39878 using Euclid's algorithm

Highest Common Factor of 5158,9353,39878 is 1

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

9353 = 5158 x 1 + 4195

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

5158 = 4195 x 1 + 963

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

4195 = 963 x 4 + 343

We consider the new divisor 963 and the new remainder 343,and apply the division lemma to get

963 = 343 x 2 + 277

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

343 = 277 x 1 + 66

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

277 = 66 x 4 + 13

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

66 = 13 x 5 + 1

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

13 = 1 x 13 + 0

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

Notice that 1 = HCF(13,1) = HCF(66,13) = HCF(277,66) = HCF(343,277) = HCF(963,343) = HCF(4195,963) = HCF(5158,4195) = HCF(9353,5158) .

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

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

39878 = 1 x 39878 + 0

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

Notice that 1 = HCF(39878,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 5158, 9353, 39878 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 5158, 9353, 39878?

Answer: HCF of 5158, 9353, 39878 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5158, 9353, 39878 using Euclid's Algorithm?

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