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