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