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

HCF of 6879, 2689, 45958 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 6879, 2689, 45958 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 6879, 2689, 45958 is 1.

HCF(6879, 2689, 45958) = 1

HCF of 6879, 2689, 45958 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 6879, 2689, 45958 is 1.

Highest Common Factor of 6879,2689,45958 using Euclid's algorithm

Highest Common Factor of 6879,2689,45958 is 1

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

6879 = 2689 x 2 + 1501

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

2689 = 1501 x 1 + 1188

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

1501 = 1188 x 1 + 313

We consider the new divisor 1188 and the new remainder 313,and apply the division lemma to get

1188 = 313 x 3 + 249

We consider the new divisor 313 and the new remainder 249,and apply the division lemma to get

313 = 249 x 1 + 64

We consider the new divisor 249 and the new remainder 64,and apply the division lemma to get

249 = 64 x 3 + 57

We consider the new divisor 64 and the new remainder 57,and apply the division lemma to get

64 = 57 x 1 + 7

We consider the new divisor 57 and the new remainder 7,and apply the division lemma to get

57 = 7 x 8 + 1

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

7 = 1 x 7 + 0

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

Notice that 1 = HCF(7,1) = HCF(57,7) = HCF(64,57) = HCF(249,64) = HCF(313,249) = HCF(1188,313) = HCF(1501,1188) = HCF(2689,1501) = HCF(6879,2689) .

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

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

45958 = 1 x 45958 + 0

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

Notice that 1 = HCF(45958,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 6879, 2689, 45958 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 6879, 2689, 45958?

Answer: HCF of 6879, 2689, 45958 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6879, 2689, 45958 using Euclid's Algorithm?

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