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

HCF of 3801, 5203, 18028 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 3801, 5203, 18028 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 3801, 5203, 18028 is 1.

HCF(3801, 5203, 18028) = 1

HCF of 3801, 5203, 18028 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 3801, 5203, 18028 is 1.

Highest Common Factor of 3801,5203,18028 using Euclid's algorithm

Highest Common Factor of 3801,5203,18028 is 1

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

5203 = 3801 x 1 + 1402

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

3801 = 1402 x 2 + 997

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

1402 = 997 x 1 + 405

We consider the new divisor 997 and the new remainder 405,and apply the division lemma to get

997 = 405 x 2 + 187

We consider the new divisor 405 and the new remainder 187,and apply the division lemma to get

405 = 187 x 2 + 31

We consider the new divisor 187 and the new remainder 31,and apply the division lemma to get

187 = 31 x 6 + 1

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

31 = 1 x 31 + 0

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

Notice that 1 = HCF(31,1) = HCF(187,31) = HCF(405,187) = HCF(997,405) = HCF(1402,997) = HCF(3801,1402) = HCF(5203,3801) .

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

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

18028 = 1 x 18028 + 0

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

Notice that 1 = HCF(18028,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 3801, 5203, 18028 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 3801, 5203, 18028?

Answer: HCF of 3801, 5203, 18028 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 3801, 5203, 18028 using Euclid's Algorithm?

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