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