Highest Common Factor of 6022, 4758, 20426 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 6022, 4758, 20426 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 6022, 4758, 20426 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 6022, 4758, 20426 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 6022, 4758, 20426 is 2.
HCF(6022, 4758, 20426) = 2
HCF of 6022, 4758, 20426 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6022, 4758, 20426 is 2.
Highest Common Factor of 6022,4758,20426 is 2
Step 1: Since 6022 > 4758, we apply the division lemma to 6022 and 4758, to get
6022 = 4758 x 1 + 1264
Step 2: Since the reminder 4758 ≠ 0, we apply division lemma to 1264 and 4758, to get
4758 = 1264 x 3 + 966
Step 3: We consider the new divisor 1264 and the new remainder 966, and apply the division lemma to get
1264 = 966 x 1 + 298
We consider the new divisor 966 and the new remainder 298,and apply the division lemma to get
966 = 298 x 3 + 72
We consider the new divisor 298 and the new remainder 72,and apply the division lemma to get
298 = 72 x 4 + 10
We consider the new divisor 72 and the new remainder 10,and apply the division lemma to get
72 = 10 x 7 + 2
We consider the new divisor 10 and the new remainder 2,and apply the division lemma to get
10 = 2 x 5 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 6022 and 4758 is 2
Notice that 2 = HCF(10,2) = HCF(72,10) = HCF(298,72) = HCF(966,298) = HCF(1264,966) = HCF(4758,1264) = HCF(6022,4758) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 20426 > 2, we apply the division lemma to 20426 and 2, to get
20426 = 2 x 10213 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 20426 is 2
Notice that 2 = HCF(20426,2) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 6022, 4758, 20426 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 6022, 4758, 20426?
Answer: HCF of 6022, 4758, 20426 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6022, 4758, 20426 using Euclid's Algorithm?
Answer: For arbitrary numbers 6022, 4758, 20426 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.