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