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