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