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