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