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

HCF of 5619, 3851 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 5619, 3851 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 5619, 3851 is 1.

HCF(5619, 3851) = 1

HCF of 5619, 3851 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 5619, 3851 is 1.

Highest Common Factor of 5619,3851 using Euclid's algorithm

Highest Common Factor of 5619,3851 is 1

Step 1: Since 5619 > 3851, we apply the division lemma to 5619 and 3851, to get

5619 = 3851 x 1 + 1768

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

3851 = 1768 x 2 + 315

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

1768 = 315 x 5 + 193

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

315 = 193 x 1 + 122

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

193 = 122 x 1 + 71

We consider the new divisor 122 and the new remainder 71,and apply the division lemma to get

122 = 71 x 1 + 51

We consider the new divisor 71 and the new remainder 51,and apply the division lemma to get

71 = 51 x 1 + 20

We consider the new divisor 51 and the new remainder 20,and apply the division lemma to get

51 = 20 x 2 + 11

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

20 = 11 x 1 + 9

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

11 = 9 x 1 + 2

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

9 = 2 x 4 + 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 5619 and 3851 is 1

Notice that 1 = HCF(2,1) = HCF(9,2) = HCF(11,9) = HCF(20,11) = HCF(51,20) = HCF(71,51) = HCF(122,71) = HCF(193,122) = HCF(315,193) = HCF(1768,315) = HCF(3851,1768) = HCF(5619,3851) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5619, 3851 using Euclid's Algorithm?

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