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