HCF Calculator using the Euclid Division Algorithm helps you to find the Highest common factor (HCF) easily for 51, 85, 153 i.e. 17 the largest integer that leaves a remainder zero for all numbers.

HCF of 51, 85, 153 is 17 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 51, 85, 153 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 51, 85, 153 is **17**.

HCF(51, 85, 153) = 17

*Highest common factor* or Highest common divisor (hcd) can be calculated by Euclid's algotithm.

Highest common factor (HCF) of 51, 85, 153 is **17**.

**Step 1:** Since 85 > 51, we apply the division lemma to 85 and 51, to get

85 = 51 x 1 + 34

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

51 = 34 x 1 + 17

**Step 3:** We consider the new divisor 34 and the new remainder 17, and apply the division lemma to get

34 = 17 x 2 + 0

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

Notice that 17 = HCF(34,17) = HCF(51,34) = HCF(85,51) .

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

**Step 1:** Since 153 > 17, we apply the division lemma to 153 and 17, to get

153 = 17 x 9 + 0

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

Notice that 17 = HCF(153,17) .

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

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 51, 85, 153?

Answer: HCF of 51, 85, 153 is 17 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 51, 85, 153 using Euclid's Algorithm?

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