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