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

HCF of 7979, 4959 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 7979, 4959 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 7979, 4959 is 1.

HCF(7979, 4959) = 1

HCF of 7979, 4959 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 7979, 4959 is 1.

Highest Common Factor of 7979,4959 using Euclid's algorithm

Highest Common Factor of 7979,4959 is 1

Step 1: Since 7979 > 4959, we apply the division lemma to 7979 and 4959, to get

7979 = 4959 x 1 + 3020

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

4959 = 3020 x 1 + 1939

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

3020 = 1939 x 1 + 1081

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

1939 = 1081 x 1 + 858

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

1081 = 858 x 1 + 223

We consider the new divisor 858 and the new remainder 223,and apply the division lemma to get

858 = 223 x 3 + 189

We consider the new divisor 223 and the new remainder 189,and apply the division lemma to get

223 = 189 x 1 + 34

We consider the new divisor 189 and the new remainder 34,and apply the division lemma to get

189 = 34 x 5 + 19

We consider the new divisor 34 and the new remainder 19,and apply the division lemma to get

34 = 19 x 1 + 15

We consider the new divisor 19 and the new remainder 15,and apply the division lemma to get

19 = 15 x 1 + 4

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

15 = 4 x 3 + 3

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

4 = 3 x 1 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(15,4) = HCF(19,15) = HCF(34,19) = HCF(189,34) = HCF(223,189) = HCF(858,223) = HCF(1081,858) = HCF(1939,1081) = HCF(3020,1939) = HCF(4959,3020) = HCF(7979,4959) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 7979, 4959 using Euclid's Algorithm?

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