# Highest Common Factor of 60, 168, 180 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 60, 168, 180 i.e. 12 the largest integer that leaves a remainder zero for all numbers.

HCF of 60, 168, 180 is 12 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 60, 168, 180 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 60, 168, 180 is 12.

HCF(60, 168, 180) = 12

## HCF of 60, 168, 180 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 60, 168, 180 is 12. ### Highest Common Factor of 60,168,180 is 12

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

168 = 60 x 2 + 48

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

60 = 48 x 1 + 12

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

48 = 12 x 4 + 0

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

Notice that 12 = HCF(48,12) = HCF(60,48) = HCF(168,60) .

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

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

180 = 12 x 15 + 0

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

Notice that 12 = HCF(180,12) .

### HCF using Euclid's Algorithm Calculation Examples

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

### Frequently Asked Questions on HCF of 60, 168, 180 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 60, 168, 180?

Answer: HCF of 60, 168, 180 is 12 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 60, 168, 180 using Euclid's Algorithm?

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