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