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