Highest Common Factor of 790, 516, 24, 470 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 790, 516, 24, 470 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 790, 516, 24, 470 is 2 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 790, 516, 24, 470 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 790, 516, 24, 470 is 2.

HCF(790, 516, 24, 470) = 2

HCF of 790, 516, 24, 470 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 790, 516, 24, 470 is 2.

Highest Common Factor of 790,516,24,470 using Euclid's algorithm

Highest Common Factor of 790,516,24,470 is 2

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

790 = 516 x 1 + 274

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

516 = 274 x 1 + 242

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

274 = 242 x 1 + 32

We consider the new divisor 242 and the new remainder 32,and apply the division lemma to get

242 = 32 x 7 + 18

We consider the new divisor 32 and the new remainder 18,and apply the division lemma to get

32 = 18 x 1 + 14

We consider the new divisor 18 and the new remainder 14,and apply the division lemma to get

18 = 14 x 1 + 4

We consider the new divisor 14 and the new remainder 4,and apply the division lemma to get

14 = 4 x 3 + 2

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

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(14,4) = HCF(18,14) = HCF(32,18) = HCF(242,32) = HCF(274,242) = HCF(516,274) = HCF(790,516) .


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

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

24 = 2 x 12 + 0

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

Notice that 2 = HCF(24,2) .


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

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

470 = 2 x 235 + 0

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

Notice that 2 = HCF(470,2) .

HCF using Euclid's Algorithm Calculation Examples

Frequently Asked Questions on HCF of 790, 516, 24, 470 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 790, 516, 24, 470?

Answer: HCF of 790, 516, 24, 470 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 790, 516, 24, 470 using Euclid's Algorithm?

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