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

HCF of 5640, 4098 is 6 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 5640, 4098 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 5640, 4098 is 6.

HCF(5640, 4098) = 6

HCF of 5640, 4098 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 5640, 4098 is 6.

Highest Common Factor of 5640,4098 using Euclid's algorithm

Highest Common Factor of 5640,4098 is 6

Step 1: Since 5640 > 4098, we apply the division lemma to 5640 and 4098, to get

5640 = 4098 x 1 + 1542

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

4098 = 1542 x 2 + 1014

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

1542 = 1014 x 1 + 528

We consider the new divisor 1014 and the new remainder 528,and apply the division lemma to get

1014 = 528 x 1 + 486

We consider the new divisor 528 and the new remainder 486,and apply the division lemma to get

528 = 486 x 1 + 42

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

486 = 42 x 11 + 24

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

42 = 24 x 1 + 18

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

24 = 18 x 1 + 6

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

18 = 6 x 3 + 0

The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 6, the HCF of 5640 and 4098 is 6

Notice that 6 = HCF(18,6) = HCF(24,18) = HCF(42,24) = HCF(486,42) = HCF(528,486) = HCF(1014,528) = HCF(1542,1014) = HCF(4098,1542) = HCF(5640,4098) .

HCF using Euclid's Algorithm Calculation Examples

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

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

Answer: HCF of 5640, 4098 is 6 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 5640, 4098 using Euclid's Algorithm?

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