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

HCF of 5250, 4711, 39131 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 5250, 4711, 39131 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 5250, 4711, 39131 is 1.

HCF(5250, 4711, 39131) = 1

HCF of 5250, 4711, 39131 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 5250, 4711, 39131 is 1.

Highest Common Factor of 5250,4711,39131 using Euclid's algorithm

Highest Common Factor of 5250,4711,39131 is 1

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

5250 = 4711 x 1 + 539

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

4711 = 539 x 8 + 399

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

539 = 399 x 1 + 140

We consider the new divisor 399 and the new remainder 140,and apply the division lemma to get

399 = 140 x 2 + 119

We consider the new divisor 140 and the new remainder 119,and apply the division lemma to get

140 = 119 x 1 + 21

We consider the new divisor 119 and the new remainder 21,and apply the division lemma to get

119 = 21 x 5 + 14

We consider the new divisor 21 and the new remainder 14,and apply the division lemma to get

21 = 14 x 1 + 7

We consider the new divisor 14 and the new remainder 7,and apply the division lemma to get

14 = 7 x 2 + 0

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

Notice that 7 = HCF(14,7) = HCF(21,14) = HCF(119,21) = HCF(140,119) = HCF(399,140) = HCF(539,399) = HCF(4711,539) = HCF(5250,4711) .

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

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

39131 = 7 x 5590 + 1

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

7 = 1 x 7 + 0

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

Notice that 1 = HCF(7,1) = HCF(39131,7) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 5250, 4711, 39131 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 5250, 4711, 39131?

Answer: HCF of 5250, 4711, 39131 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5250, 4711, 39131 using Euclid's Algorithm?

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