Highest Common Factor of 9989, 5856 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 9989, 5856 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9989, 5856 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, 5856 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, 5856 is 1.
HCF(9989, 5856) = 1
HCF of 9989, 5856 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9989, 5856 is 1.
Highest Common Factor of 9989,5856 is 1
Step 1: Since 9989 > 5856, we apply the division lemma to 9989 and 5856, to get
9989 = 5856 x 1 + 4133
Step 2: Since the reminder 5856 ≠ 0, we apply division lemma to 4133 and 5856, to get
5856 = 4133 x 1 + 1723
Step 3: We consider the new divisor 4133 and the new remainder 1723, and apply the division lemma to get
4133 = 1723 x 2 + 687
We consider the new divisor 1723 and the new remainder 687,and apply the division lemma to get
1723 = 687 x 2 + 349
We consider the new divisor 687 and the new remainder 349,and apply the division lemma to get
687 = 349 x 1 + 338
We consider the new divisor 349 and the new remainder 338,and apply the division lemma to get
349 = 338 x 1 + 11
We consider the new divisor 338 and the new remainder 11,and apply the division lemma to get
338 = 11 x 30 + 8
We consider the new divisor 11 and the new remainder 8,and apply the division lemma to get
11 = 8 x 1 + 3
We consider the new divisor 8 and the new remainder 3,and apply the division lemma to get
8 = 3 x 2 + 2
We consider the new divisor 3 and the new remainder 2,and apply the division lemma to get
3 = 2 x 1 + 1
We consider the new divisor 2 and the new remainder 1,and apply the division lemma to get
2 = 1 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 9989 and 5856 is 1
Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(8,3) = HCF(11,8) = HCF(338,11) = HCF(349,338) = HCF(687,349) = HCF(1723,687) = HCF(4133,1723) = HCF(5856,4133) = HCF(9989,5856) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 9989, 5856 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 9989, 5856?
Answer: HCF of 9989, 5856 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9989, 5856 using Euclid's Algorithm?
Answer: For arbitrary numbers 9989, 5856 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.