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 9806, 964 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 9806, 964 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 9806, 964 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 9806, 964 is 2.
HCF(9806, 964) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9806, 964 is 2.
Step 1: Since 9806 > 964, we apply the division lemma to 9806 and 964, to get
9806 = 964 x 10 + 166
Step 2: Since the reminder 964 ≠ 0, we apply division lemma to 166 and 964, to get
964 = 166 x 5 + 134
Step 3: We consider the new divisor 166 and the new remainder 134, and apply the division lemma to get
166 = 134 x 1 + 32
We consider the new divisor 134 and the new remainder 32,and apply the division lemma to get
134 = 32 x 4 + 6
We consider the new divisor 32 and the new remainder 6,and apply the division lemma to get
32 = 6 x 5 + 2
We consider the new divisor 6 and the new remainder 2,and apply the division lemma to get
6 = 2 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 9806 and 964 is 2
Notice that 2 = HCF(6,2) = HCF(32,6) = HCF(134,32) = HCF(166,134) = HCF(964,166) = HCF(9806,964) .
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 9806, 964?
Answer: HCF of 9806, 964 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9806, 964 using Euclid's Algorithm?
Answer: For arbitrary numbers 9806, 964 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.