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

HCF of 371, 564, 390 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 371, 564, 390 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 371, 564, 390 is 1.

HCF(371, 564, 390) = 1

HCF of 371, 564, 390 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 371, 564, 390 is 1.

Highest Common Factor of 371,564,390 using Euclid's algorithm

Highest Common Factor of 371,564,390 is 1

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

564 = 371 x 1 + 193

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

371 = 193 x 1 + 178

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

193 = 178 x 1 + 15

We consider the new divisor 178 and the new remainder 15,and apply the division lemma to get

178 = 15 x 11 + 13

We consider the new divisor 15 and the new remainder 13,and apply the division lemma to get

15 = 13 x 1 + 2

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

13 = 2 x 6 + 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 371 and 564 is 1

Notice that 1 = HCF(2,1) = HCF(13,2) = HCF(15,13) = HCF(178,15) = HCF(193,178) = HCF(371,193) = HCF(564,371) .

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

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

390 = 1 x 390 + 0

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

Notice that 1 = HCF(390,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 371, 564, 390 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 371, 564, 390?

Answer: HCF of 371, 564, 390 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 371, 564, 390 using Euclid's Algorithm?

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