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

HCF of 3866, 6928, 77211 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 3866, 6928, 77211 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 3866, 6928, 77211 is 1.

HCF(3866, 6928, 77211) = 1

HCF of 3866, 6928, 77211 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 3866, 6928, 77211 is 1.

Highest Common Factor of 3866,6928,77211 using Euclid's algorithm

Highest Common Factor of 3866,6928,77211 is 1

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

6928 = 3866 x 1 + 3062

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

3866 = 3062 x 1 + 804

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

3062 = 804 x 3 + 650

We consider the new divisor 804 and the new remainder 650,and apply the division lemma to get

804 = 650 x 1 + 154

We consider the new divisor 650 and the new remainder 154,and apply the division lemma to get

650 = 154 x 4 + 34

We consider the new divisor 154 and the new remainder 34,and apply the division lemma to get

154 = 34 x 4 + 18

We consider the new divisor 34 and the new remainder 18,and apply the division lemma to get

34 = 18 x 1 + 16

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

18 = 16 x 1 + 2

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

16 = 2 x 8 + 0

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

Notice that 2 = HCF(16,2) = HCF(18,16) = HCF(34,18) = HCF(154,34) = HCF(650,154) = HCF(804,650) = HCF(3062,804) = HCF(3866,3062) = HCF(6928,3866) .

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

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

77211 = 2 x 38605 + 1

Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 77211 is 1

Notice that 1 = HCF(2,1) = HCF(77211,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 3866, 6928, 77211 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 3866, 6928, 77211?

Answer: HCF of 3866, 6928, 77211 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 3866, 6928, 77211 using Euclid's Algorithm?

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