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