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

HCF of 390, 520 is 130 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, 520 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, 520 is 130.

HCF(390, 520) = 130

HCF of 390, 520 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, 520 is 130.

Highest Common Factor of 390,520 using Euclid's algorithm

Highest Common Factor of 390,520 is 130

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

520 = 390 x 1 + 130

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

390 = 130 x 3 + 0

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

Notice that 130 = HCF(390,130) = HCF(520,390) .

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, 520 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, 520?

Answer: HCF of 390, 520 is 130 the largest number that divides all the numbers leaving a remainder zero.

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

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