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

HCF of 4891, 6978 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 4891, 6978 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 4891, 6978 is 1.

HCF(4891, 6978) = 1

HCF of 4891, 6978 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 4891, 6978 is 1.

Highest Common Factor of 4891,6978 using Euclid's algorithm

Highest Common Factor of 4891,6978 is 1

Step 1: Since 6978 > 4891, we apply the division lemma to 6978 and 4891, to get

6978 = 4891 x 1 + 2087

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

4891 = 2087 x 2 + 717

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

2087 = 717 x 2 + 653

We consider the new divisor 717 and the new remainder 653,and apply the division lemma to get

717 = 653 x 1 + 64

We consider the new divisor 653 and the new remainder 64,and apply the division lemma to get

653 = 64 x 10 + 13

We consider the new divisor 64 and the new remainder 13,and apply the division lemma to get

64 = 13 x 4 + 12

We consider the new divisor 13 and the new remainder 12,and apply the division lemma to get

13 = 12 x 1 + 1

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

12 = 1 x 12 + 0

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

Notice that 1 = HCF(12,1) = HCF(13,12) = HCF(64,13) = HCF(653,64) = HCF(717,653) = HCF(2087,717) = HCF(4891,2087) = HCF(6978,4891) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 4891, 6978 using Euclid's Algorithm?

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