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