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