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