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