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