Highest Common Factor of 1980, 5246 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 1980, 5246 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 1980, 5246 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 1980, 5246 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 1980, 5246 is 2.
HCF(1980, 5246) = 2
HCF of 1980, 5246 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 1980, 5246 is 2.
Highest Common Factor of 1980,5246 is 2
Step 1: Since 5246 > 1980, we apply the division lemma to 5246 and 1980, to get
5246 = 1980 x 2 + 1286
Step 2: Since the reminder 1980 ≠ 0, we apply division lemma to 1286 and 1980, to get
1980 = 1286 x 1 + 694
Step 3: We consider the new divisor 1286 and the new remainder 694, and apply the division lemma to get
1286 = 694 x 1 + 592
We consider the new divisor 694 and the new remainder 592,and apply the division lemma to get
694 = 592 x 1 + 102
We consider the new divisor 592 and the new remainder 102,and apply the division lemma to get
592 = 102 x 5 + 82
We consider the new divisor 102 and the new remainder 82,and apply the division lemma to get
102 = 82 x 1 + 20
We consider the new divisor 82 and the new remainder 20,and apply the division lemma to get
82 = 20 x 4 + 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 1980 and 5246 is 2
Notice that 2 = HCF(20,2) = HCF(82,20) = HCF(102,82) = HCF(592,102) = HCF(694,592) = HCF(1286,694) = HCF(1980,1286) = HCF(5246,1980) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 1980, 5246 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 1980, 5246?
Answer: HCF of 1980, 5246 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 1980, 5246 using Euclid's Algorithm?
Answer: For arbitrary numbers 1980, 5246 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.