Highest Common Factor of 6158, 2447, 21351 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 6158, 2447, 21351 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 6158, 2447, 21351 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 6158, 2447, 21351 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 6158, 2447, 21351 is 1.
HCF(6158, 2447, 21351) = 1
HCF of 6158, 2447, 21351 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 6158, 2447, 21351 is 1.
Highest Common Factor of 6158,2447,21351 is 1
Step 1: Since 6158 > 2447, we apply the division lemma to 6158 and 2447, to get
6158 = 2447 x 2 + 1264
Step 2: Since the reminder 2447 ≠ 0, we apply division lemma to 1264 and 2447, to get
2447 = 1264 x 1 + 1183
Step 3: We consider the new divisor 1264 and the new remainder 1183, and apply the division lemma to get
1264 = 1183 x 1 + 81
We consider the new divisor 1183 and the new remainder 81,and apply the division lemma to get
1183 = 81 x 14 + 49
We consider the new divisor 81 and the new remainder 49,and apply the division lemma to get
81 = 49 x 1 + 32
We consider the new divisor 49 and the new remainder 32,and apply the division lemma to get
49 = 32 x 1 + 17
We consider the new divisor 32 and the new remainder 17,and apply the division lemma to get
32 = 17 x 1 + 15
We consider the new divisor 17 and the new remainder 15,and apply the division lemma to get
17 = 15 x 1 + 2
We consider the new divisor 15 and the new remainder 2,and apply the division lemma to get
15 = 2 x 7 + 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 6158 and 2447 is 1
Notice that 1 = HCF(2,1) = HCF(15,2) = HCF(17,15) = HCF(32,17) = HCF(49,32) = HCF(81,49) = HCF(1183,81) = HCF(1264,1183) = HCF(2447,1264) = HCF(6158,2447) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 21351 > 1, we apply the division lemma to 21351 and 1, to get
21351 = 1 x 21351 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 1 and 21351 is 1
Notice that 1 = HCF(21351,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 6158, 2447, 21351 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 6158, 2447, 21351?
Answer: HCF of 6158, 2447, 21351 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 6158, 2447, 21351 using Euclid's Algorithm?
Answer: For arbitrary numbers 6158, 2447, 21351 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.