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

HCF of 9779, 6179 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 9779, 6179 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 9779, 6179 is 1.

HCF(9779, 6179) = 1

HCF of 9779, 6179 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 9779, 6179 is 1.

Highest Common Factor of 9779,6179 using Euclid's algorithm

Highest Common Factor of 9779,6179 is 1

Step 1: Since 9779 > 6179, we apply the division lemma to 9779 and 6179, to get

9779 = 6179 x 1 + 3600

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

6179 = 3600 x 1 + 2579

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

3600 = 2579 x 1 + 1021

We consider the new divisor 2579 and the new remainder 1021,and apply the division lemma to get

2579 = 1021 x 2 + 537

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

1021 = 537 x 1 + 484

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

537 = 484 x 1 + 53

We consider the new divisor 484 and the new remainder 53,and apply the division lemma to get

484 = 53 x 9 + 7

We consider the new divisor 53 and the new remainder 7,and apply the division lemma to get

53 = 7 x 7 + 4

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

7 = 4 x 1 + 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 9779 and 6179 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(53,7) = HCF(484,53) = HCF(537,484) = HCF(1021,537) = HCF(2579,1021) = HCF(3600,2579) = HCF(6179,3600) = HCF(9779,6179) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 9779, 6179 using Euclid's Algorithm?

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