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 5420, 3820 i.e. 20 the largest integer that leaves a remainder zero for all numbers.
HCF of 5420, 3820 is 20 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 5420, 3820 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 5420, 3820 is 20.
HCF(5420, 3820) = 20
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5420, 3820 is 20.
Step 1: Since 5420 > 3820, we apply the division lemma to 5420 and 3820, to get
5420 = 3820 x 1 + 1600
Step 2: Since the reminder 3820 ≠ 0, we apply division lemma to 1600 and 3820, to get
3820 = 1600 x 2 + 620
Step 3: We consider the new divisor 1600 and the new remainder 620, and apply the division lemma to get
1600 = 620 x 2 + 360
We consider the new divisor 620 and the new remainder 360,and apply the division lemma to get
620 = 360 x 1 + 260
We consider the new divisor 360 and the new remainder 260,and apply the division lemma to get
360 = 260 x 1 + 100
We consider the new divisor 260 and the new remainder 100,and apply the division lemma to get
260 = 100 x 2 + 60
We consider the new divisor 100 and the new remainder 60,and apply the division lemma to get
100 = 60 x 1 + 40
We consider the new divisor 60 and the new remainder 40,and apply the division lemma to get
60 = 40 x 1 + 20
We consider the new divisor 40 and the new remainder 20,and apply the division lemma to get
40 = 20 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 20, the HCF of 5420 and 3820 is 20
Notice that 20 = HCF(40,20) = HCF(60,40) = HCF(100,60) = HCF(260,100) = HCF(360,260) = HCF(620,360) = HCF(1600,620) = HCF(3820,1600) = HCF(5420,3820) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 5420, 3820?
Answer: HCF of 5420, 3820 is 20 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5420, 3820 using Euclid's Algorithm?
Answer: For arbitrary numbers 5420, 3820 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.