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

HCF of 9856, 6426, 84879 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 9856, 6426, 84879 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 9856, 6426, 84879 is 1.

HCF(9856, 6426, 84879) = 1

HCF of 9856, 6426, 84879 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 9856, 6426, 84879 is 1.

Highest Common Factor of 9856,6426,84879 using Euclid's algorithm

Highest Common Factor of 9856,6426,84879 is 1

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

9856 = 6426 x 1 + 3430

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

6426 = 3430 x 1 + 2996

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

3430 = 2996 x 1 + 434

We consider the new divisor 2996 and the new remainder 434,and apply the division lemma to get

2996 = 434 x 6 + 392

We consider the new divisor 434 and the new remainder 392,and apply the division lemma to get

434 = 392 x 1 + 42

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

392 = 42 x 9 + 14

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

42 = 14 x 3 + 0

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

Notice that 14 = HCF(42,14) = HCF(392,42) = HCF(434,392) = HCF(2996,434) = HCF(3430,2996) = HCF(6426,3430) = HCF(9856,6426) .

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

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

84879 = 14 x 6062 + 11

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

14 = 11 x 1 + 3

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

11 = 3 x 3 + 2

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

3 = 2 x 1 + 1

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 14 and 84879 is 1

Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(11,3) = HCF(14,11) = HCF(84879,14) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 9856, 6426, 84879 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 9856, 6426, 84879?

Answer: HCF of 9856, 6426, 84879 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 9856, 6426, 84879 using Euclid's Algorithm?

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