Highest Common Factor of 5858, 8268 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 5858, 8268 i.e. 2 the largest integer that leaves a remainder zero for all numbers.

HCF of 5858, 8268 is 2 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 5858, 8268 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 5858, 8268 is 2.

HCF(5858, 8268) = 2

HCF of 5858, 8268 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 5858, 8268 is 2.

Highest Common Factor of 5858,8268 using Euclid's algorithm

Highest Common Factor of 5858,8268 is 2

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

8268 = 5858 x 1 + 2410

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

5858 = 2410 x 2 + 1038

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

2410 = 1038 x 2 + 334

We consider the new divisor 1038 and the new remainder 334,and apply the division lemma to get

1038 = 334 x 3 + 36

We consider the new divisor 334 and the new remainder 36,and apply the division lemma to get

334 = 36 x 9 + 10

We consider the new divisor 36 and the new remainder 10,and apply the division lemma to get

36 = 10 x 3 + 6

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

10 = 6 x 1 + 4

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

6 = 4 x 1 + 2

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

4 = 2 x 2 + 0

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

Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(10,6) = HCF(36,10) = HCF(334,36) = HCF(1038,334) = HCF(2410,1038) = HCF(5858,2410) = HCF(8268,5858) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 5858, 8268 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 5858, 8268?

Answer: HCF of 5858, 8268 is 2 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5858, 8268 using Euclid's Algorithm?

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