Highest Common Factor of 6390, 2658, 87976 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 6390, 2658, 87976 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 6390, 2658, 87976 is 2 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 6390, 2658, 87976 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 6390, 2658, 87976 is 2.

HCF(6390, 2658, 87976) = 2

HCF of 6390, 2658, 87976 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 6390, 2658, 87976 is 2.

Highest Common Factor of 6390,2658,87976 using Euclid's algorithm

Highest Common Factor of 6390,2658,87976 is 2

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

6390 = 2658 x 2 + 1074

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

2658 = 1074 x 2 + 510

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

1074 = 510 x 2 + 54

We consider the new divisor 510 and the new remainder 54,and apply the division lemma to get

510 = 54 x 9 + 24

We consider the new divisor 54 and the new remainder 24,and apply the division lemma to get

54 = 24 x 2 + 6

We consider the new divisor 24 and the new remainder 6,and apply the division lemma to get

24 = 6 x 4 + 0

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

Notice that 6 = HCF(24,6) = HCF(54,24) = HCF(510,54) = HCF(1074,510) = HCF(2658,1074) = HCF(6390,2658) .

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

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

87976 = 6 x 14662 + 4

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

6 = 4 x 1 + 2

Step 3: 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 6 and 87976 is 2

Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(87976,6) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 6390, 2658, 87976 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 6390, 2658, 87976?

Answer: HCF of 6390, 2658, 87976 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6390, 2658, 87976 using Euclid's Algorithm?

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