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

HCF of 6479, 2845, 29915 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 6479, 2845, 29915 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 6479, 2845, 29915 is 1.

HCF(6479, 2845, 29915) = 1

HCF of 6479, 2845, 29915 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 6479, 2845, 29915 is 1.

Highest Common Factor of 6479,2845,29915 using Euclid's algorithm

Highest Common Factor of 6479,2845,29915 is 1

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

6479 = 2845 x 2 + 789

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

2845 = 789 x 3 + 478

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

789 = 478 x 1 + 311

We consider the new divisor 478 and the new remainder 311,and apply the division lemma to get

478 = 311 x 1 + 167

We consider the new divisor 311 and the new remainder 167,and apply the division lemma to get

311 = 167 x 1 + 144

We consider the new divisor 167 and the new remainder 144,and apply the division lemma to get

167 = 144 x 1 + 23

We consider the new divisor 144 and the new remainder 23,and apply the division lemma to get

144 = 23 x 6 + 6

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

23 = 6 x 3 + 5

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

6 = 5 x 1 + 1

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

5 = 1 x 5 + 0

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

Notice that 1 = HCF(5,1) = HCF(6,5) = HCF(23,6) = HCF(144,23) = HCF(167,144) = HCF(311,167) = HCF(478,311) = HCF(789,478) = HCF(2845,789) = HCF(6479,2845) .

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

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

29915 = 1 x 29915 + 0

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

Notice that 1 = HCF(29915,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 6479, 2845, 29915 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 6479, 2845, 29915?

Answer: HCF of 6479, 2845, 29915 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6479, 2845, 29915 using Euclid's Algorithm?

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