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 8906, 5182 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 8906, 5182 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 8906, 5182 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 8906, 5182 is 2.
HCF(8906, 5182) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 8906, 5182 is 2.
Step 1: Since 8906 > 5182, we apply the division lemma to 8906 and 5182, to get
8906 = 5182 x 1 + 3724
Step 2: Since the reminder 5182 ≠ 0, we apply division lemma to 3724 and 5182, to get
5182 = 3724 x 1 + 1458
Step 3: We consider the new divisor 3724 and the new remainder 1458, and apply the division lemma to get
3724 = 1458 x 2 + 808
We consider the new divisor 1458 and the new remainder 808,and apply the division lemma to get
1458 = 808 x 1 + 650
We consider the new divisor 808 and the new remainder 650,and apply the division lemma to get
808 = 650 x 1 + 158
We consider the new divisor 650 and the new remainder 158,and apply the division lemma to get
650 = 158 x 4 + 18
We consider the new divisor 158 and the new remainder 18,and apply the division lemma to get
158 = 18 x 8 + 14
We consider the new divisor 18 and the new remainder 14,and apply the division lemma to get
18 = 14 x 1 + 4
We consider the new divisor 14 and the new remainder 4,and apply the division lemma to get
14 = 4 x 3 + 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 8906 and 5182 is 2
Notice that 2 = HCF(4,2) = HCF(14,4) = HCF(18,14) = HCF(158,18) = HCF(650,158) = HCF(808,650) = HCF(1458,808) = HCF(3724,1458) = HCF(5182,3724) = HCF(8906,5182) .
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 8906, 5182?
Answer: HCF of 8906, 5182 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 8906, 5182 using Euclid's Algorithm?
Answer: For arbitrary numbers 8906, 5182 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.