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 8138, 5487 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 8138, 5487 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 8138, 5487 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 8138, 5487 is 1.
HCF(8138, 5487) = 1
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 8138, 5487 is 1.
Step 1: Since 8138 > 5487, we apply the division lemma to 8138 and 5487, to get
8138 = 5487 x 1 + 2651
Step 2: Since the reminder 5487 ≠ 0, we apply division lemma to 2651 and 5487, to get
5487 = 2651 x 2 + 185
Step 3: We consider the new divisor 2651 and the new remainder 185, and apply the division lemma to get
2651 = 185 x 14 + 61
We consider the new divisor 185 and the new remainder 61,and apply the division lemma to get
185 = 61 x 3 + 2
We consider the new divisor 61 and the new remainder 2,and apply the division lemma to get
61 = 2 x 30 + 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 8138 and 5487 is 1
Notice that 1 = HCF(2,1) = HCF(61,2) = HCF(185,61) = HCF(2651,185) = HCF(5487,2651) = HCF(8138,5487) .
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 8138, 5487?
Answer: HCF of 8138, 5487 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 8138, 5487 using Euclid's Algorithm?
Answer: For arbitrary numbers 8138, 5487 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.