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

HCF of 4818, 1426, 86600 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 4818, 1426, 86600 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 4818, 1426, 86600 is 2.

HCF(4818, 1426, 86600) = 2

HCF of 4818, 1426, 86600 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 4818, 1426, 86600 is 2.

Highest Common Factor of 4818,1426,86600 using Euclid's algorithm

Highest Common Factor of 4818,1426,86600 is 2

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

4818 = 1426 x 3 + 540

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

1426 = 540 x 2 + 346

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

540 = 346 x 1 + 194

We consider the new divisor 346 and the new remainder 194,and apply the division lemma to get

346 = 194 x 1 + 152

We consider the new divisor 194 and the new remainder 152,and apply the division lemma to get

194 = 152 x 1 + 42

We consider the new divisor 152 and the new remainder 42,and apply the division lemma to get

152 = 42 x 3 + 26

We consider the new divisor 42 and the new remainder 26,and apply the division lemma to get

42 = 26 x 1 + 16

We consider the new divisor 26 and the new remainder 16,and apply the division lemma to get

26 = 16 x 1 + 10

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

16 = 10 x 1 + 6

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

10 = 6 x 1 + 4

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

6 = 4 x 1 + 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 4818 and 1426 is 2

Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(10,6) = HCF(16,10) = HCF(26,16) = HCF(42,26) = HCF(152,42) = HCF(194,152) = HCF(346,194) = HCF(540,346) = HCF(1426,540) = HCF(4818,1426) .

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

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

86600 = 2 x 43300 + 0

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

Notice that 2 = HCF(86600,2) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 4818, 1426, 86600 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 4818, 1426, 86600?

Answer: HCF of 4818, 1426, 86600 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 4818, 1426, 86600 using Euclid's Algorithm?

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