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