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