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

HCF of 6679, 5208, 85404 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 6679, 5208, 85404 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 6679, 5208, 85404 is 1.

HCF(6679, 5208, 85404) = 1

HCF of 6679, 5208, 85404 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 6679, 5208, 85404 is 1.

Highest Common Factor of 6679,5208,85404 using Euclid's algorithm

Highest Common Factor of 6679,5208,85404 is 1

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

6679 = 5208 x 1 + 1471

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

5208 = 1471 x 3 + 795

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

1471 = 795 x 1 + 676

We consider the new divisor 795 and the new remainder 676,and apply the division lemma to get

795 = 676 x 1 + 119

We consider the new divisor 676 and the new remainder 119,and apply the division lemma to get

676 = 119 x 5 + 81

We consider the new divisor 119 and the new remainder 81,and apply the division lemma to get

119 = 81 x 1 + 38

We consider the new divisor 81 and the new remainder 38,and apply the division lemma to get

81 = 38 x 2 + 5

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

38 = 5 x 7 + 3

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

5 = 3 x 1 + 2

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

3 = 2 x 1 + 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 6679 and 5208 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(38,5) = HCF(81,38) = HCF(119,81) = HCF(676,119) = HCF(795,676) = HCF(1471,795) = HCF(5208,1471) = HCF(6679,5208) .

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

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

85404 = 1 x 85404 + 0

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

Notice that 1 = HCF(85404,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 6679, 5208, 85404 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 6679, 5208, 85404?

Answer: HCF of 6679, 5208, 85404 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6679, 5208, 85404 using Euclid's Algorithm?

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