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