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