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

HCF of 2142, 1571, 11319 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 2142, 1571, 11319 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 2142, 1571, 11319 is 1.

HCF(2142, 1571, 11319) = 1

HCF of 2142, 1571, 11319 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 2142, 1571, 11319 is 1.

Highest Common Factor of 2142,1571,11319 using Euclid's algorithm

Highest Common Factor of 2142,1571,11319 is 1

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

2142 = 1571 x 1 + 571

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

1571 = 571 x 2 + 429

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

571 = 429 x 1 + 142

We consider the new divisor 429 and the new remainder 142,and apply the division lemma to get

429 = 142 x 3 + 3

We consider the new divisor 142 and the new remainder 3,and apply the division lemma to get

142 = 3 x 47 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(142,3) = HCF(429,142) = HCF(571,429) = HCF(1571,571) = HCF(2142,1571) .

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

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

11319 = 1 x 11319 + 0

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

Notice that 1 = HCF(11319,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 2142, 1571, 11319 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 2142, 1571, 11319?

Answer: HCF of 2142, 1571, 11319 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2142, 1571, 11319 using Euclid's Algorithm?

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