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