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

HCF of 87, 52, 83, 145 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 87, 52, 83, 145 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 87, 52, 83, 145 is 1.

HCF(87, 52, 83, 145) = 1

HCF of 87, 52, 83, 145 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 87, 52, 83, 145 is 1.

Highest Common Factor of 87,52,83,145 using Euclid's algorithm

Highest Common Factor of 87,52,83,145 is 1

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

87 = 52 x 1 + 35

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

52 = 35 x 1 + 17

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

35 = 17 x 2 + 1

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

17 = 1 x 17 + 0

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

Notice that 1 = HCF(17,1) = HCF(35,17) = HCF(52,35) = HCF(87,52) .


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

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

83 = 1 x 83 + 0

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

Notice that 1 = HCF(83,1) .


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

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

145 = 1 x 145 + 0

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

Notice that 1 = HCF(145,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 87, 52, 83, 145 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 87, 52, 83, 145?

Answer: HCF of 87, 52, 83, 145 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 87, 52, 83, 145 using Euclid's Algorithm?

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