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

HCF of 786, 5156, 2905 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 786, 5156, 2905 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 786, 5156, 2905 is 1.

HCF(786, 5156, 2905) = 1

HCF of 786, 5156, 2905 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 786, 5156, 2905 is 1.

Highest Common Factor of 786,5156,2905 using Euclid's algorithm

Highest Common Factor of 786,5156,2905 is 1

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

5156 = 786 x 6 + 440

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

786 = 440 x 1 + 346

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

440 = 346 x 1 + 94

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

346 = 94 x 3 + 64

We consider the new divisor 94 and the new remainder 64,and apply the division lemma to get

94 = 64 x 1 + 30

We consider the new divisor 64 and the new remainder 30,and apply the division lemma to get

64 = 30 x 2 + 4

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

30 = 4 x 7 + 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 786 and 5156 is 2

Notice that 2 = HCF(4,2) = HCF(30,4) = HCF(64,30) = HCF(94,64) = HCF(346,94) = HCF(440,346) = HCF(786,440) = HCF(5156,786) .

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

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

2905 = 2 x 1452 + 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 2905 is 1

Notice that 1 = HCF(2,1) = HCF(2905,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 786, 5156, 2905 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 786, 5156, 2905?

Answer: HCF of 786, 5156, 2905 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 786, 5156, 2905 using Euclid's Algorithm?

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