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