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