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