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

HCF of 8857, 4979 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 8857, 4979 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 8857, 4979 is 1.

HCF(8857, 4979) = 1

HCF of 8857, 4979 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 8857, 4979 is 1.

Highest Common Factor of 8857,4979 using Euclid's algorithm

Highest Common Factor of 8857,4979 is 1

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

8857 = 4979 x 1 + 3878

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

4979 = 3878 x 1 + 1101

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

3878 = 1101 x 3 + 575

We consider the new divisor 1101 and the new remainder 575,and apply the division lemma to get

1101 = 575 x 1 + 526

We consider the new divisor 575 and the new remainder 526,and apply the division lemma to get

575 = 526 x 1 + 49

We consider the new divisor 526 and the new remainder 49,and apply the division lemma to get

526 = 49 x 10 + 36

We consider the new divisor 49 and the new remainder 36,and apply the division lemma to get

49 = 36 x 1 + 13

We consider the new divisor 36 and the new remainder 13,and apply the division lemma to get

36 = 13 x 2 + 10

We consider the new divisor 13 and the new remainder 10,and apply the division lemma to get

13 = 10 x 1 + 3

We consider the new divisor 10 and the new remainder 3,and apply the division lemma to get

10 = 3 x 3 + 1

We consider the new divisor 3 and the new remainder 1,and apply the division lemma to get

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(10,3) = HCF(13,10) = HCF(36,13) = HCF(49,36) = HCF(526,49) = HCF(575,526) = HCF(1101,575) = HCF(3878,1101) = HCF(4979,3878) = HCF(8857,4979) .

HCF using Euclid's Algorithm Calculation Examples

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

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

Answer: HCF of 8857, 4979 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 8857, 4979 using Euclid's Algorithm?

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