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