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