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