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

HCF of 8017, 4851 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 8017, 4851 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 8017, 4851 is 1.

HCF(8017, 4851) = 1

HCF of 8017, 4851 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 8017, 4851 is 1.

Highest Common Factor of 8017,4851 using Euclid's algorithm

Highest Common Factor of 8017,4851 is 1

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

8017 = 4851 x 1 + 3166

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

4851 = 3166 x 1 + 1685

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

3166 = 1685 x 1 + 1481

We consider the new divisor 1685 and the new remainder 1481,and apply the division lemma to get

1685 = 1481 x 1 + 204

We consider the new divisor 1481 and the new remainder 204,and apply the division lemma to get

1481 = 204 x 7 + 53

We consider the new divisor 204 and the new remainder 53,and apply the division lemma to get

204 = 53 x 3 + 45

We consider the new divisor 53 and the new remainder 45,and apply the division lemma to get

53 = 45 x 1 + 8

We consider the new divisor 45 and the new remainder 8,and apply the division lemma to get

45 = 8 x 5 + 5

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

8 = 5 x 1 + 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 8017 and 4851 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(8,5) = HCF(45,8) = HCF(53,45) = HCF(204,53) = HCF(1481,204) = HCF(1685,1481) = HCF(3166,1685) = HCF(4851,3166) = HCF(8017,4851) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 8017, 4851 using Euclid's Algorithm?

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