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

HCF of 3808, 5419, 90005 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 3808, 5419, 90005 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 3808, 5419, 90005 is 1.

HCF(3808, 5419, 90005) = 1

HCF of 3808, 5419, 90005 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 3808, 5419, 90005 is 1.

Highest Common Factor of 3808,5419,90005 using Euclid's algorithm

Highest Common Factor of 3808,5419,90005 is 1

Step 1: Since 5419 > 3808, we apply the division lemma to 5419 and 3808, to get

5419 = 3808 x 1 + 1611

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

3808 = 1611 x 2 + 586

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

1611 = 586 x 2 + 439

We consider the new divisor 586 and the new remainder 439,and apply the division lemma to get

586 = 439 x 1 + 147

We consider the new divisor 439 and the new remainder 147,and apply the division lemma to get

439 = 147 x 2 + 145

We consider the new divisor 147 and the new remainder 145,and apply the division lemma to get

147 = 145 x 1 + 2

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

145 = 2 x 72 + 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 3808 and 5419 is 1

Notice that 1 = HCF(2,1) = HCF(145,2) = HCF(147,145) = HCF(439,147) = HCF(586,439) = HCF(1611,586) = HCF(3808,1611) = HCF(5419,3808) .

We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma

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

90005 = 1 x 90005 + 0

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

Notice that 1 = HCF(90005,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 3808, 5419, 90005 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 3808, 5419, 90005?

Answer: HCF of 3808, 5419, 90005 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 3808, 5419, 90005 using Euclid's Algorithm?

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