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 2826, 7978 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 2826, 7978 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 2826, 7978 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 2826, 7978 is 2.
HCF(2826, 7978) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 2826, 7978 is 2.
Step 1: Since 7978 > 2826, we apply the division lemma to 7978 and 2826, to get
7978 = 2826 x 2 + 2326
Step 2: Since the reminder 2826 ≠ 0, we apply division lemma to 2326 and 2826, to get
2826 = 2326 x 1 + 500
Step 3: We consider the new divisor 2326 and the new remainder 500, and apply the division lemma to get
2326 = 500 x 4 + 326
We consider the new divisor 500 and the new remainder 326,and apply the division lemma to get
500 = 326 x 1 + 174
We consider the new divisor 326 and the new remainder 174,and apply the division lemma to get
326 = 174 x 1 + 152
We consider the new divisor 174 and the new remainder 152,and apply the division lemma to get
174 = 152 x 1 + 22
We consider the new divisor 152 and the new remainder 22,and apply the division lemma to get
152 = 22 x 6 + 20
We consider the new divisor 22 and the new remainder 20,and apply the division lemma to get
22 = 20 x 1 + 2
We consider the new divisor 20 and the new remainder 2,and apply the division lemma to get
20 = 2 x 10 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2826 and 7978 is 2
Notice that 2 = HCF(20,2) = HCF(22,20) = HCF(152,22) = HCF(174,152) = HCF(326,174) = HCF(500,326) = HCF(2326,500) = HCF(2826,2326) = HCF(7978,2826) .
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 2826, 7978?
Answer: HCF of 2826, 7978 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 2826, 7978 using Euclid's Algorithm?
Answer: For arbitrary numbers 2826, 7978 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.