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

HCF of 7892, 4986, 68387 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 7892, 4986, 68387 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 7892, 4986, 68387 is 1.

HCF(7892, 4986, 68387) = 1

HCF of 7892, 4986, 68387 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 7892, 4986, 68387 is 1.

Highest Common Factor of 7892,4986,68387 using Euclid's algorithm

Highest Common Factor of 7892,4986,68387 is 1

Step 1: Since 7892 > 4986, we apply the division lemma to 7892 and 4986, to get

7892 = 4986 x 1 + 2906

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

4986 = 2906 x 1 + 2080

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

2906 = 2080 x 1 + 826

We consider the new divisor 2080 and the new remainder 826,and apply the division lemma to get

2080 = 826 x 2 + 428

We consider the new divisor 826 and the new remainder 428,and apply the division lemma to get

826 = 428 x 1 + 398

We consider the new divisor 428 and the new remainder 398,and apply the division lemma to get

428 = 398 x 1 + 30

We consider the new divisor 398 and the new remainder 30,and apply the division lemma to get

398 = 30 x 13 + 8

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

30 = 8 x 3 + 6

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

8 = 6 x 1 + 2

We consider the new divisor 6 and the new remainder 2,and apply the division lemma to get

6 = 2 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 7892 and 4986 is 2

Notice that 2 = HCF(6,2) = HCF(8,6) = HCF(30,8) = HCF(398,30) = HCF(428,398) = HCF(826,428) = HCF(2080,826) = HCF(2906,2080) = HCF(4986,2906) = HCF(7892,4986) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

Step 1: Since 68387 > 2, we apply the division lemma to 68387 and 2, to get

68387 = 2 x 34193 + 1

Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 68387 is 1

Notice that 1 = HCF(2,1) = HCF(68387,2) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 7892, 4986, 68387 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 7892, 4986, 68387?

Answer: HCF of 7892, 4986, 68387 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 7892, 4986, 68387 using Euclid's Algorithm?

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