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