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

HCF of 777, 1795, 2136 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 777, 1795, 2136 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 777, 1795, 2136 is 1.

HCF(777, 1795, 2136) = 1

HCF of 777, 1795, 2136 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 777, 1795, 2136 is 1.

Highest Common Factor of 777,1795,2136 using Euclid's algorithm

Highest Common Factor of 777,1795,2136 is 1

Step 1: Since 1795 > 777, we apply the division lemma to 1795 and 777, to get

1795 = 777 x 2 + 241

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

777 = 241 x 3 + 54

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

241 = 54 x 4 + 25

We consider the new divisor 54 and the new remainder 25,and apply the division lemma to get

54 = 25 x 2 + 4

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

25 = 4 x 6 + 1

We consider the new divisor 4 and the new remainder 1,and apply the division lemma 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 777 and 1795 is 1

Notice that 1 = HCF(4,1) = HCF(25,4) = HCF(54,25) = HCF(241,54) = HCF(777,241) = HCF(1795,777) .

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

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

2136 = 1 x 2136 + 0

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

Notice that 1 = HCF(2136,1) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 777, 1795, 2136 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 777, 1795, 2136?

Answer: HCF of 777, 1795, 2136 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 777, 1795, 2136 using Euclid's Algorithm?

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