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