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 802, 4994 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 802, 4994 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 802, 4994 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 802, 4994 is 2.
HCF(802, 4994) = 2
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 802, 4994 is 2.
Step 1: Since 4994 > 802, we apply the division lemma to 4994 and 802, to get
4994 = 802 x 6 + 182
Step 2: Since the reminder 802 ≠ 0, we apply division lemma to 182 and 802, to get
802 = 182 x 4 + 74
Step 3: We consider the new divisor 182 and the new remainder 74, and apply the division lemma to get
182 = 74 x 2 + 34
We consider the new divisor 74 and the new remainder 34,and apply the division lemma to get
74 = 34 x 2 + 6
We consider the new divisor 34 and the new remainder 6,and apply the division lemma to get
34 = 6 x 5 + 4
We consider the new divisor 6 and the new remainder 4,and apply the division lemma to get
6 = 4 x 1 + 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 802 and 4994 is 2
Notice that 2 = HCF(4,2) = HCF(6,4) = HCF(34,6) = HCF(74,34) = HCF(182,74) = HCF(802,182) = HCF(4994,802) .
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 802, 4994?
Answer: HCF of 802, 4994 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 802, 4994 using Euclid's Algorithm?
Answer: For arbitrary numbers 802, 4994 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.