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