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

HCF of 1672, 8787 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 1672, 8787 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 1672, 8787 is 1.

HCF(1672, 8787) = 1

HCF of 1672, 8787 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 1672, 8787 is 1.

Highest Common Factor of 1672,8787 using Euclid's algorithm

Highest Common Factor of 1672,8787 is 1

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

8787 = 1672 x 5 + 427

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

1672 = 427 x 3 + 391

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

427 = 391 x 1 + 36

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

391 = 36 x 10 + 31

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

36 = 31 x 1 + 5

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

31 = 5 x 6 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(31,5) = HCF(36,31) = HCF(391,36) = HCF(427,391) = HCF(1672,427) = HCF(8787,1672) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 1672, 8787 using Euclid's Algorithm?

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