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