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