Highest Common Factor of 5986, 8290 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 5986, 8290 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 5986, 8290 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 5986, 8290 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 5986, 8290 is 2.
HCF(5986, 8290) = 2
HCF of 5986, 8290 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5986, 8290 is 2.
Highest Common Factor of 5986,8290 is 2
Step 1: Since 8290 > 5986, we apply the division lemma to 8290 and 5986, to get
8290 = 5986 x 1 + 2304
Step 2: Since the reminder 5986 ≠ 0, we apply division lemma to 2304 and 5986, to get
5986 = 2304 x 2 + 1378
Step 3: We consider the new divisor 2304 and the new remainder 1378, and apply the division lemma to get
2304 = 1378 x 1 + 926
We consider the new divisor 1378 and the new remainder 926,and apply the division lemma to get
1378 = 926 x 1 + 452
We consider the new divisor 926 and the new remainder 452,and apply the division lemma to get
926 = 452 x 2 + 22
We consider the new divisor 452 and the new remainder 22,and apply the division lemma to get
452 = 22 x 20 + 12
We consider the new divisor 22 and the new remainder 12,and apply the division lemma to get
22 = 12 x 1 + 10
We consider the new divisor 12 and the new remainder 10,and apply the division lemma to get
12 = 10 x 1 + 2
We consider the new divisor 10 and the new remainder 2,and apply the division lemma to get
10 = 2 x 5 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 5986 and 8290 is 2
Notice that 2 = HCF(10,2) = HCF(12,10) = HCF(22,12) = HCF(452,22) = HCF(926,452) = HCF(1378,926) = HCF(2304,1378) = HCF(5986,2304) = HCF(8290,5986) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 5986, 8290 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 5986, 8290?
Answer: HCF of 5986, 8290 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5986, 8290 using Euclid's Algorithm?
Answer: For arbitrary numbers 5986, 8290 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.