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