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