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