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