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