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