Highest Common Factor of 6116, 5049 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 6116, 5049 i.e. 11 the largest integer that leaves a remainder zero for all numbers.
HCF of 6116, 5049 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 6116, 5049 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 6116, 5049 is 11.
HCF(6116, 5049) = 11
HCF of 6116, 5049 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6116, 5049 is 11.
Highest Common Factor of 6116,5049 is 11
Step 1: Since 6116 > 5049, we apply the division lemma to 6116 and 5049, to get
6116 = 5049 x 1 + 1067
Step 2: Since the reminder 5049 ≠ 0, we apply division lemma to 1067 and 5049, to get
5049 = 1067 x 4 + 781
Step 3: We consider the new divisor 1067 and the new remainder 781, and apply the division lemma to get
1067 = 781 x 1 + 286
We consider the new divisor 781 and the new remainder 286,and apply the division lemma to get
781 = 286 x 2 + 209
We consider the new divisor 286 and the new remainder 209,and apply the division lemma to get
286 = 209 x 1 + 77
We consider the new divisor 209 and the new remainder 77,and apply the division lemma to get
209 = 77 x 2 + 55
We consider the new divisor 77 and the new remainder 55,and apply the division lemma to get
77 = 55 x 1 + 22
We consider the new divisor 55 and the new remainder 22,and apply the division lemma to get
55 = 22 x 2 + 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 6116 and 5049 is 11
Notice that 11 = HCF(22,11) = HCF(55,22) = HCF(77,55) = HCF(209,77) = HCF(286,209) = HCF(781,286) = HCF(1067,781) = HCF(5049,1067) = HCF(6116,5049) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 6116, 5049 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 6116, 5049?
Answer: HCF of 6116, 5049 is 11 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6116, 5049 using Euclid's Algorithm?
Answer: For arbitrary numbers 6116, 5049 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.