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

HCF of 7206, 2949, 86209 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 7206, 2949, 86209 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 7206, 2949, 86209 is 1.

HCF(7206, 2949, 86209) = 1

HCF of 7206, 2949, 86209 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 7206, 2949, 86209 is 1.

Highest Common Factor of 7206,2949,86209 using Euclid's algorithm

Highest Common Factor of 7206,2949,86209 is 1

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

7206 = 2949 x 2 + 1308

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

2949 = 1308 x 2 + 333

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

1308 = 333 x 3 + 309

We consider the new divisor 333 and the new remainder 309,and apply the division lemma to get

333 = 309 x 1 + 24

We consider the new divisor 309 and the new remainder 24,and apply the division lemma to get

309 = 24 x 12 + 21

We consider the new divisor 24 and the new remainder 21,and apply the division lemma to get

24 = 21 x 1 + 3

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

21 = 3 x 7 + 0

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

Notice that 3 = HCF(21,3) = HCF(24,21) = HCF(309,24) = HCF(333,309) = HCF(1308,333) = HCF(2949,1308) = HCF(7206,2949) .

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

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

86209 = 3 x 28736 + 1

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

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(86209,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 7206, 2949, 86209 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 7206, 2949, 86209?

Answer: HCF of 7206, 2949, 86209 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 7206, 2949, 86209 using Euclid's Algorithm?

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