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