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

HCF of 3510, 5983, 87123 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 3510, 5983, 87123 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 3510, 5983, 87123 is 1.

HCF(3510, 5983, 87123) = 1

HCF of 3510, 5983, 87123 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 3510, 5983, 87123 is 1.

Highest Common Factor of 3510,5983,87123 using Euclid's algorithm

Highest Common Factor of 3510,5983,87123 is 1

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

5983 = 3510 x 1 + 2473

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

3510 = 2473 x 1 + 1037

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

2473 = 1037 x 2 + 399

We consider the new divisor 1037 and the new remainder 399,and apply the division lemma to get

1037 = 399 x 2 + 239

We consider the new divisor 399 and the new remainder 239,and apply the division lemma to get

399 = 239 x 1 + 160

We consider the new divisor 239 and the new remainder 160,and apply the division lemma to get

239 = 160 x 1 + 79

We consider the new divisor 160 and the new remainder 79,and apply the division lemma to get

160 = 79 x 2 + 2

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

79 = 2 x 39 + 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 3510 and 5983 is 1

Notice that 1 = HCF(2,1) = HCF(79,2) = HCF(160,79) = HCF(239,160) = HCF(399,239) = HCF(1037,399) = HCF(2473,1037) = HCF(3510,2473) = HCF(5983,3510) .

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

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

87123 = 1 x 87123 + 0

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

Notice that 1 = HCF(87123,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 3510, 5983, 87123 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 3510, 5983, 87123?

Answer: HCF of 3510, 5983, 87123 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 3510, 5983, 87123 using Euclid's Algorithm?

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