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 800, 19419 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 800, 19419 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 800, 19419 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 800, 19419 is 1.
HCF(800, 19419) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 800, 19419 is 1.
Step 1: Since 19419 > 800, we apply the division lemma to 19419 and 800, to get
19419 = 800 x 24 + 219
Step 2: Since the reminder 800 ≠ 0, we apply division lemma to 219 and 800, to get
800 = 219 x 3 + 143
Step 3: We consider the new divisor 219 and the new remainder 143, and apply the division lemma to get
219 = 143 x 1 + 76
We consider the new divisor 143 and the new remainder 76,and apply the division lemma to get
143 = 76 x 1 + 67
We consider the new divisor 76 and the new remainder 67,and apply the division lemma to get
76 = 67 x 1 + 9
We consider the new divisor 67 and the new remainder 9,and apply the division lemma to get
67 = 9 x 7 + 4
We consider the new divisor 9 and the new remainder 4,and apply the division lemma to get
9 = 4 x 2 + 1
We consider the new divisor 4 and the new remainder 1,and apply the division lemma to get
4 = 1 x 4 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 800 and 19419 is 1
Notice that 1 = HCF(4,1) = HCF(9,4) = HCF(67,9) = HCF(76,67) = HCF(143,76) = HCF(219,143) = HCF(800,219) = HCF(19419,800) .
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 800, 19419?
Answer: HCF of 800, 19419 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 800, 19419 using Euclid's Algorithm?
Answer: For arbitrary numbers 800, 19419 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.