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