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

HCF of 390, 708, 517 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 390, 708, 517 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 390, 708, 517 is 1.

HCF(390, 708, 517) = 1

HCF of 390, 708, 517 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 390, 708, 517 is 1.

Highest Common Factor of 390,708,517 using Euclid's algorithm

Highest Common Factor of 390,708,517 is 1

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

708 = 390 x 1 + 318

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

390 = 318 x 1 + 72

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

318 = 72 x 4 + 30

We consider the new divisor 72 and the new remainder 30,and apply the division lemma to get

72 = 30 x 2 + 12

We consider the new divisor 30 and the new remainder 12,and apply the division lemma to get

30 = 12 x 2 + 6

We consider the new divisor 12 and the new remainder 6,and apply the division lemma to get

12 = 6 x 2 + 0

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

Notice that 6 = HCF(12,6) = HCF(30,12) = HCF(72,30) = HCF(318,72) = HCF(390,318) = HCF(708,390) .

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

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

517 = 6 x 86 + 1

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

6 = 1 x 6 + 0

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

Notice that 1 = HCF(6,1) = HCF(517,6) .

HCF using Euclid's Algorithm Calculation Examples

Here are some samples of HCF using Euclid's Algorithm calculations.

Frequently Asked Questions on HCF of 390, 708, 517 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 390, 708, 517?

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

3. How to find HCF of 390, 708, 517 using Euclid's Algorithm?

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