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