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