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