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