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