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

HCF of 6786, 8869 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 6786, 8869 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 6786, 8869 is 1.

HCF(6786, 8869) = 1

HCF of 6786, 8869 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 6786, 8869 is 1.

Highest Common Factor of 6786,8869 using Euclid's algorithm

Highest Common Factor of 6786,8869 is 1

Step 1: Since 8869 > 6786, we apply the division lemma to 8869 and 6786, to get

8869 = 6786 x 1 + 2083

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

6786 = 2083 x 3 + 537

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

2083 = 537 x 3 + 472

We consider the new divisor 537 and the new remainder 472,and apply the division lemma to get

537 = 472 x 1 + 65

We consider the new divisor 472 and the new remainder 65,and apply the division lemma to get

472 = 65 x 7 + 17

We consider the new divisor 65 and the new remainder 17,and apply the division lemma to get

65 = 17 x 3 + 14

We consider the new divisor 17 and the new remainder 14,and apply the division lemma to get

17 = 14 x 1 + 3

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

14 = 3 x 4 + 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 6786 and 8869 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(14,3) = HCF(17,14) = HCF(65,17) = HCF(472,65) = HCF(537,472) = HCF(2083,537) = HCF(6786,2083) = HCF(8869,6786) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 6786, 8869 using Euclid's Algorithm?

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