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

HCF of 5151, 8503, 47685 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 5151, 8503, 47685 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 5151, 8503, 47685 is 1.

HCF(5151, 8503, 47685) = 1

HCF of 5151, 8503, 47685 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 5151, 8503, 47685 is 1.

Highest Common Factor of 5151,8503,47685 using Euclid's algorithm

Highest Common Factor of 5151,8503,47685 is 1

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

8503 = 5151 x 1 + 3352

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

5151 = 3352 x 1 + 1799

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

3352 = 1799 x 1 + 1553

We consider the new divisor 1799 and the new remainder 1553,and apply the division lemma to get

1799 = 1553 x 1 + 246

We consider the new divisor 1553 and the new remainder 246,and apply the division lemma to get

1553 = 246 x 6 + 77

We consider the new divisor 246 and the new remainder 77,and apply the division lemma to get

246 = 77 x 3 + 15

We consider the new divisor 77 and the new remainder 15,and apply the division lemma to get

77 = 15 x 5 + 2

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

15 = 2 x 7 + 1

We consider the new divisor 2 and the new remainder 1,and apply the division lemma 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 5151 and 8503 is 1

Notice that 1 = HCF(2,1) = HCF(15,2) = HCF(77,15) = HCF(246,77) = HCF(1553,246) = HCF(1799,1553) = HCF(3352,1799) = HCF(5151,3352) = HCF(8503,5151) .

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

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

47685 = 1 x 47685 + 0

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

Notice that 1 = HCF(47685,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 5151, 8503, 47685 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 5151, 8503, 47685?

Answer: HCF of 5151, 8503, 47685 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5151, 8503, 47685 using Euclid's Algorithm?

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