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

HCF of 2859, 6972, 46349 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 2859, 6972, 46349 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 2859, 6972, 46349 is 1.

HCF(2859, 6972, 46349) = 1

HCF of 2859, 6972, 46349 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 2859, 6972, 46349 is 1.

Highest Common Factor of 2859,6972,46349 using Euclid's algorithm

Highest Common Factor of 2859,6972,46349 is 1

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

6972 = 2859 x 2 + 1254

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

2859 = 1254 x 2 + 351

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

1254 = 351 x 3 + 201

We consider the new divisor 351 and the new remainder 201,and apply the division lemma to get

351 = 201 x 1 + 150

We consider the new divisor 201 and the new remainder 150,and apply the division lemma to get

201 = 150 x 1 + 51

We consider the new divisor 150 and the new remainder 51,and apply the division lemma to get

150 = 51 x 2 + 48

We consider the new divisor 51 and the new remainder 48,and apply the division lemma to get

51 = 48 x 1 + 3

We consider the new divisor 48 and the new remainder 3,and apply the division lemma to get

48 = 3 x 16 + 0

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

Notice that 3 = HCF(48,3) = HCF(51,48) = HCF(150,51) = HCF(201,150) = HCF(351,201) = HCF(1254,351) = HCF(2859,1254) = HCF(6972,2859) .

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

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

46349 = 3 x 15449 + 2

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

3 = 2 x 1 + 1

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

2 = 1 x 2 + 0

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

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(46349,3) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 2859, 6972, 46349 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 2859, 6972, 46349?

Answer: HCF of 2859, 6972, 46349 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 2859, 6972, 46349 using Euclid's Algorithm?

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