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

HCF of 5049, 5720, 38848 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 5049, 5720, 38848 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 5049, 5720, 38848 is 1.

HCF(5049, 5720, 38848) = 1

HCF of 5049, 5720, 38848 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 5049, 5720, 38848 is 1.

Highest Common Factor of 5049,5720,38848 using Euclid's algorithm

Highest Common Factor of 5049,5720,38848 is 1

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

5720 = 5049 x 1 + 671

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

5049 = 671 x 7 + 352

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

671 = 352 x 1 + 319

We consider the new divisor 352 and the new remainder 319,and apply the division lemma to get

352 = 319 x 1 + 33

We consider the new divisor 319 and the new remainder 33,and apply the division lemma to get

319 = 33 x 9 + 22

We consider the new divisor 33 and the new remainder 22,and apply the division lemma to get

33 = 22 x 1 + 11

We consider the new divisor 22 and the new remainder 11,and apply the division lemma to get

22 = 11 x 2 + 0

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

Notice that 11 = HCF(22,11) = HCF(33,22) = HCF(319,33) = HCF(352,319) = HCF(671,352) = HCF(5049,671) = HCF(5720,5049) .

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

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

38848 = 11 x 3531 + 7

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

11 = 7 x 1 + 4

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

7 = 4 x 1 + 3

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

4 = 3 x 1 + 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 11 and 38848 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(7,4) = HCF(11,7) = HCF(38848,11) .

HCF using Euclid's Algorithm Calculation Examples

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

Frequently Asked Questions on HCF of 5049, 5720, 38848 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 5049, 5720, 38848?

Answer: HCF of 5049, 5720, 38848 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5049, 5720, 38848 using Euclid's Algorithm?

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