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

HCF of 3868, 9772, 77121 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 3868, 9772, 77121 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 3868, 9772, 77121 is 1.

HCF(3868, 9772, 77121) = 1

HCF of 3868, 9772, 77121 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 3868, 9772, 77121 is 1.

Highest Common Factor of 3868,9772,77121 using Euclid's algorithm

Highest Common Factor of 3868,9772,77121 is 1

Step 1: Since 9772 > 3868, we apply the division lemma to 9772 and 3868, to get

9772 = 3868 x 2 + 2036

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

3868 = 2036 x 1 + 1832

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

2036 = 1832 x 1 + 204

We consider the new divisor 1832 and the new remainder 204,and apply the division lemma to get

1832 = 204 x 8 + 200

We consider the new divisor 204 and the new remainder 200,and apply the division lemma to get

204 = 200 x 1 + 4

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

200 = 4 x 50 + 0

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

Notice that 4 = HCF(200,4) = HCF(204,200) = HCF(1832,204) = HCF(2036,1832) = HCF(3868,2036) = HCF(9772,3868) .

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

Step 1: Since 77121 > 4, we apply the division lemma to 77121 and 4, to get

77121 = 4 x 19280 + 1

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

4 = 1 x 4 + 0

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

Notice that 1 = HCF(4,1) = HCF(77121,4) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 3868, 9772, 77121 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 3868, 9772, 77121?

Answer: HCF of 3868, 9772, 77121 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 3868, 9772, 77121 using Euclid's Algorithm?

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