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

HCF of 4987, 8672 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 4987, 8672 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 4987, 8672 is 1.

HCF(4987, 8672) = 1

HCF of 4987, 8672 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 4987, 8672 is 1.

Highest Common Factor of 4987,8672 using Euclid's algorithm

Highest Common Factor of 4987,8672 is 1

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

8672 = 4987 x 1 + 3685

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

4987 = 3685 x 1 + 1302

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

3685 = 1302 x 2 + 1081

We consider the new divisor 1302 and the new remainder 1081,and apply the division lemma to get

1302 = 1081 x 1 + 221

We consider the new divisor 1081 and the new remainder 221,and apply the division lemma to get

1081 = 221 x 4 + 197

We consider the new divisor 221 and the new remainder 197,and apply the division lemma to get

221 = 197 x 1 + 24

We consider the new divisor 197 and the new remainder 24,and apply the division lemma to get

197 = 24 x 8 + 5

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

24 = 5 x 4 + 4

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

5 = 4 x 1 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(5,4) = HCF(24,5) = HCF(197,24) = HCF(221,197) = HCF(1081,221) = HCF(1302,1081) = HCF(3685,1302) = HCF(4987,3685) = HCF(8672,4987) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 4987, 8672 using Euclid's Algorithm?

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