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

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

HCF(4021, 6422) = 1

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

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

Highest Common Factor of 4021,6422 is 1

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

6422 = 4021 x 1 + 2401

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

4021 = 2401 x 1 + 1620

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

2401 = 1620 x 1 + 781

We consider the new divisor 1620 and the new remainder 781,and apply the division lemma to get

1620 = 781 x 2 + 58

We consider the new divisor 781 and the new remainder 58,and apply the division lemma to get

781 = 58 x 13 + 27

We consider the new divisor 58 and the new remainder 27,and apply the division lemma to get

58 = 27 x 2 + 4

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

27 = 4 x 6 + 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 4021 and 6422 is 1

Notice that 1 = HCF(3,1) = HCF(4,3) = HCF(27,4) = HCF(58,27) = HCF(781,58) = HCF(1620,781) = HCF(2401,1620) = HCF(4021,2401) = HCF(6422,4021) .

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, 6422 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, 6422?

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

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

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