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