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