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

HCF of 4985, 1058, 12004 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 4985, 1058, 12004 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 4985, 1058, 12004 is 1.

HCF(4985, 1058, 12004) = 1

HCF of 4985, 1058, 12004 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 4985, 1058, 12004 is 1.

Highest Common Factor of 4985,1058,12004 using Euclid's algorithm

Highest Common Factor of 4985,1058,12004 is 1

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

4985 = 1058 x 4 + 753

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

1058 = 753 x 1 + 305

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

753 = 305 x 2 + 143

We consider the new divisor 305 and the new remainder 143,and apply the division lemma to get

305 = 143 x 2 + 19

We consider the new divisor 143 and the new remainder 19,and apply the division lemma to get

143 = 19 x 7 + 10

We consider the new divisor 19 and the new remainder 10,and apply the division lemma to get

19 = 10 x 1 + 9

We consider the new divisor 10 and the new remainder 9,and apply the division lemma to get

10 = 9 x 1 + 1

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

9 = 1 x 9 + 0

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

Notice that 1 = HCF(9,1) = HCF(10,9) = HCF(19,10) = HCF(143,19) = HCF(305,143) = HCF(753,305) = HCF(1058,753) = HCF(4985,1058) .

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

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

12004 = 1 x 12004 + 0

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

Notice that 1 = HCF(12004,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 4985, 1058, 12004 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 4985, 1058, 12004?

Answer: HCF of 4985, 1058, 12004 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 4985, 1058, 12004 using Euclid's Algorithm?

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