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

HCF of 4002, 5396 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 4002, 5396 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 4002, 5396 is 2.

HCF(4002, 5396) = 2

HCF of 4002, 5396 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 4002, 5396 is 2.

Highest Common Factor of 4002,5396 using Euclid's algorithm

Highest Common Factor of 4002,5396 is 2

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

5396 = 4002 x 1 + 1394

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

4002 = 1394 x 2 + 1214

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

1394 = 1214 x 1 + 180

We consider the new divisor 1214 and the new remainder 180,and apply the division lemma to get

1214 = 180 x 6 + 134

We consider the new divisor 180 and the new remainder 134,and apply the division lemma to get

180 = 134 x 1 + 46

We consider the new divisor 134 and the new remainder 46,and apply the division lemma to get

134 = 46 x 2 + 42

We consider the new divisor 46 and the new remainder 42,and apply the division lemma to get

46 = 42 x 1 + 4

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

42 = 4 x 10 + 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 4002 and 5396 is 2

Notice that 2 = HCF(4,2) = HCF(42,4) = HCF(46,42) = HCF(134,46) = HCF(180,134) = HCF(1214,180) = HCF(1394,1214) = HCF(4002,1394) = HCF(5396,4002) .

HCF using Euclid's Algorithm Calculation Examples

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

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

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

3. How to find HCF of 4002, 5396 using Euclid's Algorithm?

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