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

HCF of 4948, 5258, 28705 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 4948, 5258, 28705 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 4948, 5258, 28705 is 1.

HCF(4948, 5258, 28705) = 1

HCF of 4948, 5258, 28705 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 4948, 5258, 28705 is 1.

Highest Common Factor of 4948,5258,28705 using Euclid's algorithm

Highest Common Factor of 4948,5258,28705 is 1

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

5258 = 4948 x 1 + 310

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

4948 = 310 x 15 + 298

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

310 = 298 x 1 + 12

We consider the new divisor 298 and the new remainder 12,and apply the division lemma to get

298 = 12 x 24 + 10

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

12 = 10 x 1 + 2

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

10 = 2 x 5 + 0

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

Notice that 2 = HCF(10,2) = HCF(12,10) = HCF(298,12) = HCF(310,298) = HCF(4948,310) = HCF(5258,4948) .

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

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

28705 = 2 x 14352 + 1

Step 2: Since the reminder 2 ≠ 0, we apply division lemma to 1 and 2, 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 2 and 28705 is 1

Notice that 1 = HCF(2,1) = HCF(28705,2) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 4948, 5258, 28705 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 4948, 5258, 28705?

Answer: HCF of 4948, 5258, 28705 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 4948, 5258, 28705 using Euclid's Algorithm?

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