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

HCF of 6136, 4790, 11719 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 6136, 4790, 11719 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 6136, 4790, 11719 is 1.

HCF(6136, 4790, 11719) = 1

HCF of 6136, 4790, 11719 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 6136, 4790, 11719 is 1.

Highest Common Factor of 6136,4790,11719 using Euclid's algorithm

Highest Common Factor of 6136,4790,11719 is 1

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

6136 = 4790 x 1 + 1346

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

4790 = 1346 x 3 + 752

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

1346 = 752 x 1 + 594

We consider the new divisor 752 and the new remainder 594,and apply the division lemma to get

752 = 594 x 1 + 158

We consider the new divisor 594 and the new remainder 158,and apply the division lemma to get

594 = 158 x 3 + 120

We consider the new divisor 158 and the new remainder 120,and apply the division lemma to get

158 = 120 x 1 + 38

We consider the new divisor 120 and the new remainder 38,and apply the division lemma to get

120 = 38 x 3 + 6

We consider the new divisor 38 and the new remainder 6,and apply the division lemma to get

38 = 6 x 6 + 2

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

6 = 2 x 3 + 0

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

Notice that 2 = HCF(6,2) = HCF(38,6) = HCF(120,38) = HCF(158,120) = HCF(594,158) = HCF(752,594) = HCF(1346,752) = HCF(4790,1346) = HCF(6136,4790) .

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

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

11719 = 2 x 5859 + 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 11719 is 1

Notice that 1 = HCF(2,1) = HCF(11719,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 6136, 4790, 11719 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 6136, 4790, 11719?

Answer: HCF of 6136, 4790, 11719 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 6136, 4790, 11719 using Euclid's Algorithm?

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