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