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

HCF of 4021, 2898 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 4021, 2898 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 4021, 2898 is 1.

HCF(4021, 2898) = 1

HCF of 4021, 2898 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 4021, 2898 is 1.

Highest Common Factor of 4021,2898 using Euclid's algorithm

Highest Common Factor of 4021,2898 is 1

Step 1: Since 4021 > 2898, we apply the division lemma to 4021 and 2898, to get

4021 = 2898 x 1 + 1123

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

2898 = 1123 x 2 + 652

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

1123 = 652 x 1 + 471

We consider the new divisor 652 and the new remainder 471,and apply the division lemma to get

652 = 471 x 1 + 181

We consider the new divisor 471 and the new remainder 181,and apply the division lemma to get

471 = 181 x 2 + 109

We consider the new divisor 181 and the new remainder 109,and apply the division lemma to get

181 = 109 x 1 + 72

We consider the new divisor 109 and the new remainder 72,and apply the division lemma to get

109 = 72 x 1 + 37

We consider the new divisor 72 and the new remainder 37,and apply the division lemma to get

72 = 37 x 1 + 35

We consider the new divisor 37 and the new remainder 35,and apply the division lemma to get

37 = 35 x 1 + 2

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

35 = 2 x 17 + 1

We consider the new divisor 2 and the new remainder 1,and apply the division lemma 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 4021 and 2898 is 1

Notice that 1 = HCF(2,1) = HCF(35,2) = HCF(37,35) = HCF(72,37) = HCF(109,72) = HCF(181,109) = HCF(471,181) = HCF(652,471) = HCF(1123,652) = HCF(2898,1123) = HCF(4021,2898) .

HCF using Euclid's Algorithm Calculation Examples

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

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

Answer: HCF of 4021, 2898 is 1 the largest number that divides all the numbers leaving a remainder zero.

3. How to find HCF of 4021, 2898 using Euclid's Algorithm?

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