Highest Common Factor of 2938, 3218, 47024 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 2938, 3218, 47024 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 2938, 3218, 47024 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 2938, 3218, 47024 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 2938, 3218, 47024 is 2.
HCF(2938, 3218, 47024) = 2
HCF of 2938, 3218, 47024 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 2938, 3218, 47024 is 2.
Highest Common Factor of 2938,3218,47024 is 2
Step 1: Since 3218 > 2938, we apply the division lemma to 3218 and 2938, to get
3218 = 2938 x 1 + 280
Step 2: Since the reminder 2938 ≠ 0, we apply division lemma to 280 and 2938, to get
2938 = 280 x 10 + 138
Step 3: We consider the new divisor 280 and the new remainder 138, and apply the division lemma to get
280 = 138 x 2 + 4
We consider the new divisor 138 and the new remainder 4,and apply the division lemma to get
138 = 4 x 34 + 2
We consider the new divisor 4 and the new remainder 2,and apply the division lemma to get
4 = 2 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2938 and 3218 is 2
Notice that 2 = HCF(4,2) = HCF(138,4) = HCF(280,138) = HCF(2938,280) = HCF(3218,2938) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 47024 > 2, we apply the division lemma to 47024 and 2, to get
47024 = 2 x 23512 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 47024 is 2
Notice that 2 = HCF(47024,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 2938, 3218, 47024 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 2938, 3218, 47024?
Answer: HCF of 2938, 3218, 47024 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 2938, 3218, 47024 using Euclid's Algorithm?
Answer: For arbitrary numbers 2938, 3218, 47024 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.