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