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