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

HCF of 5938, 4966 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 5938, 4966 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 5938, 4966 is 2.

HCF(5938, 4966) = 2

HCF of 5938, 4966 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 5938, 4966 is 2.

Highest Common Factor of 5938,4966 using Euclid's algorithm

Highest Common Factor of 5938,4966 is 2

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

5938 = 4966 x 1 + 972

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

4966 = 972 x 5 + 106

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

972 = 106 x 9 + 18

We consider the new divisor 106 and the new remainder 18,and apply the division lemma to get

106 = 18 x 5 + 16

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

18 = 16 x 1 + 2

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

16 = 2 x 8 + 0

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

Notice that 2 = HCF(16,2) = HCF(18,16) = HCF(106,18) = HCF(972,106) = HCF(4966,972) = HCF(5938,4966) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 5938, 4966 using Euclid's Algorithm?

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