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 9999, 3118 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 9999, 3118 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 9999, 3118 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 9999, 3118 is 1.
HCF(9999, 3118) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9999, 3118 is 1.
Step 1: Since 9999 > 3118, we apply the division lemma to 9999 and 3118, to get
9999 = 3118 x 3 + 645
Step 2: Since the reminder 3118 ≠ 0, we apply division lemma to 645 and 3118, to get
3118 = 645 x 4 + 538
Step 3: We consider the new divisor 645 and the new remainder 538, and apply the division lemma to get
645 = 538 x 1 + 107
We consider the new divisor 538 and the new remainder 107,and apply the division lemma to get
538 = 107 x 5 + 3
We consider the new divisor 107 and the new remainder 3,and apply the division lemma to get
107 = 3 x 35 + 2
We consider the new divisor 3 and the new remainder 2,and apply the division lemma to get
3 = 2 x 1 + 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 9999 and 3118 is 1
Notice that 1 = HCF(2,1) = HCF(3,2) = HCF(107,3) = HCF(538,107) = HCF(645,538) = HCF(3118,645) = HCF(9999,3118) .
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 9999, 3118?
Answer: HCF of 9999, 3118 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9999, 3118 using Euclid's Algorithm?
Answer: For arbitrary numbers 9999, 3118 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.