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