Highest Common Factor of 9856, 3370 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 9856, 3370 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 9856, 3370 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 9856, 3370 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 9856, 3370 is 2.
HCF(9856, 3370) = 2
HCF of 9856, 3370 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9856, 3370 is 2.
Highest Common Factor of 9856,3370 is 2
Step 1: Since 9856 > 3370, we apply the division lemma to 9856 and 3370, to get
9856 = 3370 x 2 + 3116
Step 2: Since the reminder 3370 ≠ 0, we apply division lemma to 3116 and 3370, to get
3370 = 3116 x 1 + 254
Step 3: We consider the new divisor 3116 and the new remainder 254, and apply the division lemma to get
3116 = 254 x 12 + 68
We consider the new divisor 254 and the new remainder 68,and apply the division lemma to get
254 = 68 x 3 + 50
We consider the new divisor 68 and the new remainder 50,and apply the division lemma to get
68 = 50 x 1 + 18
We consider the new divisor 50 and the new remainder 18,and apply the division lemma to get
50 = 18 x 2 + 14
We consider the new divisor 18 and the new remainder 14,and apply the division lemma to get
18 = 14 x 1 + 4
We consider the new divisor 14 and the new remainder 4,and apply the division lemma to get
14 = 4 x 3 + 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 9856 and 3370 is 2
Notice that 2 = HCF(4,2) = HCF(14,4) = HCF(18,14) = HCF(50,18) = HCF(68,50) = HCF(254,68) = HCF(3116,254) = HCF(3370,3116) = HCF(9856,3370) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 9856, 3370 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 9856, 3370?
Answer: HCF of 9856, 3370 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9856, 3370 using Euclid's Algorithm?
Answer: For arbitrary numbers 9856, 3370 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.