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

HCF of 3989, 5113 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 3989, 5113 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 3989, 5113 is 1.

HCF(3989, 5113) = 1

HCF of 3989, 5113 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 3989, 5113 is 1.

Highest Common Factor of 3989,5113 using Euclid's algorithm

Highest Common Factor of 3989,5113 is 1

Step 1: Since 5113 > 3989, we apply the division lemma to 5113 and 3989, to get

5113 = 3989 x 1 + 1124

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

3989 = 1124 x 3 + 617

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

1124 = 617 x 1 + 507

We consider the new divisor 617 and the new remainder 507,and apply the division lemma to get

617 = 507 x 1 + 110

We consider the new divisor 507 and the new remainder 110,and apply the division lemma to get

507 = 110 x 4 + 67

We consider the new divisor 110 and the new remainder 67,and apply the division lemma to get

110 = 67 x 1 + 43

We consider the new divisor 67 and the new remainder 43,and apply the division lemma to get

67 = 43 x 1 + 24

We consider the new divisor 43 and the new remainder 24,and apply the division lemma to get

43 = 24 x 1 + 19

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

24 = 19 x 1 + 5

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

19 = 5 x 3 + 4

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

5 = 4 x 1 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(5,4) = HCF(19,5) = HCF(24,19) = HCF(43,24) = HCF(67,43) = HCF(110,67) = HCF(507,110) = HCF(617,507) = HCF(1124,617) = HCF(3989,1124) = HCF(5113,3989) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 3989, 5113 using Euclid's Algorithm?

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