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

HCF of 857, 473, 851 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 857, 473, 851 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 857, 473, 851 is 1.

HCF(857, 473, 851) = 1

HCF of 857, 473, 851 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 857, 473, 851 is 1.

Highest Common Factor of 857,473,851 using Euclid's algorithm

Highest Common Factor of 857,473,851 is 1

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

857 = 473 x 1 + 384

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

473 = 384 x 1 + 89

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

384 = 89 x 4 + 28

We consider the new divisor 89 and the new remainder 28,and apply the division lemma to get

89 = 28 x 3 + 5

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

28 = 5 x 5 + 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 857 and 473 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(28,5) = HCF(89,28) = HCF(384,89) = HCF(473,384) = HCF(857,473) .

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

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

851 = 1 x 851 + 0

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

Notice that 1 = HCF(851,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 857, 473, 851 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 857, 473, 851?

Answer: HCF of 857, 473, 851 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 857, 473, 851 using Euclid's Algorithm?

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