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