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