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