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