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

HCF of 5489, 980 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 5489, 980 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 5489, 980 is 1.

HCF(5489, 980) = 1

HCF of 5489, 980 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 5489, 980 is 1.

Highest Common Factor of 5489,980 using Euclid's algorithm

Highest Common Factor of 5489,980 is 1

Step 1: Since 5489 > 980, we apply the division lemma to 5489 and 980, to get

5489 = 980 x 5 + 589

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

980 = 589 x 1 + 391

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

589 = 391 x 1 + 198

We consider the new divisor 391 and the new remainder 198,and apply the division lemma to get

391 = 198 x 1 + 193

We consider the new divisor 198 and the new remainder 193,and apply the division lemma to get

198 = 193 x 1 + 5

We consider the new divisor 193 and the new remainder 5,and apply the division lemma to get

193 = 5 x 38 + 3

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

5 = 3 x 1 + 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 5489 and 980 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(5,3) = HCF(193,5) = HCF(198,193) = HCF(391,198) = HCF(589,391) = HCF(980,589) = HCF(5489,980) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5489, 980 using Euclid's Algorithm?

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