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

HCF of 3128, 5115 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 3128, 5115 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 3128, 5115 is 1.

HCF(3128, 5115) = 1

HCF of 3128, 5115 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 3128, 5115 is 1.

Highest Common Factor of 3128,5115 using Euclid's algorithm

Highest Common Factor of 3128,5115 is 1

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

5115 = 3128 x 1 + 1987

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

3128 = 1987 x 1 + 1141

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

1987 = 1141 x 1 + 846

We consider the new divisor 1141 and the new remainder 846,and apply the division lemma to get

1141 = 846 x 1 + 295

We consider the new divisor 846 and the new remainder 295,and apply the division lemma to get

846 = 295 x 2 + 256

We consider the new divisor 295 and the new remainder 256,and apply the division lemma to get

295 = 256 x 1 + 39

We consider the new divisor 256 and the new remainder 39,and apply the division lemma to get

256 = 39 x 6 + 22

We consider the new divisor 39 and the new remainder 22,and apply the division lemma to get

39 = 22 x 1 + 17

We consider the new divisor 22 and the new remainder 17,and apply the division lemma to get

22 = 17 x 1 + 5

We consider the new divisor 17 and the new remainder 5,and apply the division lemma to get

17 = 5 x 3 + 2

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

5 = 2 x 2 + 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 3128 and 5115 is 1

Notice that 1 = HCF(2,1) = HCF(5,2) = HCF(17,5) = HCF(22,17) = HCF(39,22) = HCF(256,39) = HCF(295,256) = HCF(846,295) = HCF(1141,846) = HCF(1987,1141) = HCF(3128,1987) = HCF(5115,3128) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 3128, 5115 using Euclid's Algorithm?

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