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