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