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