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