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

HCF of 5157, 8320, 98802 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 5157, 8320, 98802 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 5157, 8320, 98802 is 1.

HCF(5157, 8320, 98802) = 1

HCF of 5157, 8320, 98802 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 5157, 8320, 98802 is 1.

Highest Common Factor of 5157,8320,98802 using Euclid's algorithm

Highest Common Factor of 5157,8320,98802 is 1

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

8320 = 5157 x 1 + 3163

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

5157 = 3163 x 1 + 1994

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

3163 = 1994 x 1 + 1169

We consider the new divisor 1994 and the new remainder 1169,and apply the division lemma to get

1994 = 1169 x 1 + 825

We consider the new divisor 1169 and the new remainder 825,and apply the division lemma to get

1169 = 825 x 1 + 344

We consider the new divisor 825 and the new remainder 344,and apply the division lemma to get

825 = 344 x 2 + 137

We consider the new divisor 344 and the new remainder 137,and apply the division lemma to get

344 = 137 x 2 + 70

We consider the new divisor 137 and the new remainder 70,and apply the division lemma to get

137 = 70 x 1 + 67

We consider the new divisor 70 and the new remainder 67,and apply the division lemma to get

70 = 67 x 1 + 3

We consider the new divisor 67 and the new remainder 3,and apply the division lemma to get

67 = 3 x 22 + 1

We consider the new divisor 3 and the new remainder 1,and apply the division lemma to get

3 = 1 x 3 + 0

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

Notice that 1 = HCF(3,1) = HCF(67,3) = HCF(70,67) = HCF(137,70) = HCF(344,137) = HCF(825,344) = HCF(1169,825) = HCF(1994,1169) = HCF(3163,1994) = HCF(5157,3163) = HCF(8320,5157) .

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

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

98802 = 1 x 98802 + 0

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

Notice that 1 = HCF(98802,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 5157, 8320, 98802 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 5157, 8320, 98802?

Answer: HCF of 5157, 8320, 98802 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5157, 8320, 98802 using Euclid's Algorithm?

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