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