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