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