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 5889, 4774, 86915 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 5889, 4774, 86915 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 5889, 4774, 86915 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 5889, 4774, 86915 is 1.
HCF(5889, 4774, 86915) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5889, 4774, 86915 is 1.
Step 1: Since 5889 > 4774, we apply the division lemma to 5889 and 4774, to get
5889 = 4774 x 1 + 1115
Step 2: Since the reminder 4774 ≠ 0, we apply division lemma to 1115 and 4774, to get
4774 = 1115 x 4 + 314
Step 3: We consider the new divisor 1115 and the new remainder 314, and apply the division lemma to get
1115 = 314 x 3 + 173
We consider the new divisor 314 and the new remainder 173,and apply the division lemma to get
314 = 173 x 1 + 141
We consider the new divisor 173 and the new remainder 141,and apply the division lemma to get
173 = 141 x 1 + 32
We consider the new divisor 141 and the new remainder 32,and apply the division lemma to get
141 = 32 x 4 + 13
We consider the new divisor 32 and the new remainder 13,and apply the division lemma to get
32 = 13 x 2 + 6
We consider the new divisor 13 and the new remainder 6,and apply the division lemma to get
13 = 6 x 2 + 1
We consider the new divisor 6 and the new remainder 1,and apply the division lemma to get
6 = 1 x 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 5889 and 4774 is 1
Notice that 1 = HCF(6,1) = HCF(13,6) = HCF(32,13) = HCF(141,32) = HCF(173,141) = HCF(314,173) = HCF(1115,314) = HCF(4774,1115) = HCF(5889,4774) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 86915 > 1, we apply the division lemma to 86915 and 1, to get
86915 = 1 x 86915 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 86915 is 1
Notice that 1 = HCF(86915,1) .
Here are some samples of HCF using Euclid's Algorithm calculations.
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 5889, 4774, 86915?
Answer: HCF of 5889, 4774, 86915 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5889, 4774, 86915 using Euclid's Algorithm?
Answer: For arbitrary numbers 5889, 4774, 86915 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.