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

HCF of 972, 510, 14 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 972, 510, 14 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 972, 510, 14 is 2.

HCF(972, 510, 14) = 2

HCF of 972, 510, 14 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 972, 510, 14 is 2.

Highest Common Factor of 972,510,14 using Euclid's algorithm

Highest Common Factor of 972,510,14 is 2

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

972 = 510 x 1 + 462

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

510 = 462 x 1 + 48

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

462 = 48 x 9 + 30

We consider the new divisor 48 and the new remainder 30,and apply the division lemma to get

48 = 30 x 1 + 18

We consider the new divisor 30 and the new remainder 18,and apply the division lemma to get

30 = 18 x 1 + 12

We consider the new divisor 18 and the new remainder 12,and apply the division lemma to get

18 = 12 x 1 + 6

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

12 = 6 x 2 + 0

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

Notice that 6 = HCF(12,6) = HCF(18,12) = HCF(30,18) = HCF(48,30) = HCF(462,48) = HCF(510,462) = HCF(972,510) .


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

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

14 = 6 x 2 + 2

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

6 = 2 x 3 + 0

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

Notice that 2 = HCF(6,2) = HCF(14,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 972, 510, 14 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 972, 510, 14?

Answer: HCF of 972, 510, 14 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 972, 510, 14 using Euclid's Algorithm?

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