Highest Common Factor of 8556, 2358 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 8556, 2358 i.e. 6 the largest integer that leaves a remainder zero for all numbers.

HCF of 8556, 2358 is 6 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 8556, 2358 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 8556, 2358 is 6.

HCF(8556, 2358) = 6

HCF of 8556, 2358 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 8556, 2358 is 6.

Highest Common Factor of 8556,2358 using Euclid's algorithm

Highest Common Factor of 8556,2358 is 6

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

8556 = 2358 x 3 + 1482

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

2358 = 1482 x 1 + 876

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

1482 = 876 x 1 + 606

We consider the new divisor 876 and the new remainder 606,and apply the division lemma to get

876 = 606 x 1 + 270

We consider the new divisor 606 and the new remainder 270,and apply the division lemma to get

606 = 270 x 2 + 66

We consider the new divisor 270 and the new remainder 66,and apply the division lemma to get

270 = 66 x 4 + 6

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

66 = 6 x 11 + 0

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

Notice that 6 = HCF(66,6) = HCF(270,66) = HCF(606,270) = HCF(876,606) = HCF(1482,876) = HCF(2358,1482) = HCF(8556,2358) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 8556, 2358 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 8556, 2358?

Answer: HCF of 8556, 2358 is 6 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 8556, 2358 using Euclid's Algorithm?

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