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