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

HCF of 8389, 5081 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 8389, 5081 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 8389, 5081 is 1.

HCF(8389, 5081) = 1

HCF of 8389, 5081 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 8389, 5081 is 1.

Highest Common Factor of 8389,5081 using Euclid's algorithm

Highest Common Factor of 8389,5081 is 1

Step 1: Since 8389 > 5081, we apply the division lemma to 8389 and 5081, to get

8389 = 5081 x 1 + 3308

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

5081 = 3308 x 1 + 1773

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

3308 = 1773 x 1 + 1535

We consider the new divisor 1773 and the new remainder 1535,and apply the division lemma to get

1773 = 1535 x 1 + 238

We consider the new divisor 1535 and the new remainder 238,and apply the division lemma to get

1535 = 238 x 6 + 107

We consider the new divisor 238 and the new remainder 107,and apply the division lemma to get

238 = 107 x 2 + 24

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

107 = 24 x 4 + 11

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

24 = 11 x 2 + 2

We consider the new divisor 11 and the new remainder 2,and apply the division lemma to get

11 = 2 x 5 + 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 8389 and 5081 is 1

Notice that 1 = HCF(2,1) = HCF(11,2) = HCF(24,11) = HCF(107,24) = HCF(238,107) = HCF(1535,238) = HCF(1773,1535) = HCF(3308,1773) = HCF(5081,3308) = HCF(8389,5081) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 8389, 5081 using Euclid's Algorithm?

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