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

HCF of 5358, 8245, 61818 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 5358, 8245, 61818 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 5358, 8245, 61818 is 1.

HCF(5358, 8245, 61818) = 1

HCF of 5358, 8245, 61818 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 5358, 8245, 61818 is 1.

Highest Common Factor of 5358,8245,61818 using Euclid's algorithm

Highest Common Factor of 5358,8245,61818 is 1

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

8245 = 5358 x 1 + 2887

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

5358 = 2887 x 1 + 2471

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

2887 = 2471 x 1 + 416

We consider the new divisor 2471 and the new remainder 416,and apply the division lemma to get

2471 = 416 x 5 + 391

We consider the new divisor 416 and the new remainder 391,and apply the division lemma to get

416 = 391 x 1 + 25

We consider the new divisor 391 and the new remainder 25,and apply the division lemma to get

391 = 25 x 15 + 16

We consider the new divisor 25 and the new remainder 16,and apply the division lemma to get

25 = 16 x 1 + 9

We consider the new divisor 16 and the new remainder 9,and apply the division lemma to get

16 = 9 x 1 + 7

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

9 = 7 x 1 + 2

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

7 = 2 x 3 + 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 5358 and 8245 is 1

Notice that 1 = HCF(2,1) = HCF(7,2) = HCF(9,7) = HCF(16,9) = HCF(25,16) = HCF(391,25) = HCF(416,391) = HCF(2471,416) = HCF(2887,2471) = HCF(5358,2887) = HCF(8245,5358) .

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

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

61818 = 1 x 61818 + 0

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

Notice that 1 = HCF(61818,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 5358, 8245, 61818 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 5358, 8245, 61818?

Answer: HCF of 5358, 8245, 61818 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5358, 8245, 61818 using Euclid's Algorithm?

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