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