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