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