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