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