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 5797, 7799 i.e. 11 the largest integer that leaves a remainder zero for all numbers.
HCF of 5797, 7799 is 11 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 5797, 7799 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 5797, 7799 is 11.
HCF(5797, 7799) = 11
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 5797, 7799 is 11.
Step 1: Since 7799 > 5797, we apply the division lemma to 7799 and 5797, to get
7799 = 5797 x 1 + 2002
Step 2: Since the reminder 5797 ≠ 0, we apply division lemma to 2002 and 5797, to get
5797 = 2002 x 2 + 1793
Step 3: We consider the new divisor 2002 and the new remainder 1793, and apply the division lemma to get
2002 = 1793 x 1 + 209
We consider the new divisor 1793 and the new remainder 209,and apply the division lemma to get
1793 = 209 x 8 + 121
We consider the new divisor 209 and the new remainder 121,and apply the division lemma to get
209 = 121 x 1 + 88
We consider the new divisor 121 and the new remainder 88,and apply the division lemma to get
121 = 88 x 1 + 33
We consider the new divisor 88 and the new remainder 33,and apply the division lemma to get
88 = 33 x 2 + 22
We consider the new divisor 33 and the new remainder 22,and apply the division lemma to get
33 = 22 x 1 + 11
We consider the new divisor 22 and the new remainder 11,and apply the division lemma to get
22 = 11 x 2 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 11, the HCF of 5797 and 7799 is 11
Notice that 11 = HCF(22,11) = HCF(33,22) = HCF(88,33) = HCF(121,88) = HCF(209,121) = HCF(1793,209) = HCF(2002,1793) = HCF(5797,2002) = HCF(7799,5797) .
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 5797, 7799?
Answer: HCF of 5797, 7799 is 11 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 5797, 7799 using Euclid's Algorithm?
Answer: For arbitrary numbers 5797, 7799 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.