Highest Common Factor of 797, 1240 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 797, 1240 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 797, 1240 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 797, 1240 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 797, 1240 is 1.
HCF(797, 1240) = 1
HCF of 797, 1240 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 797, 1240 is 1.
Highest Common Factor of 797,1240 is 1
Step 1: Since 1240 > 797, we apply the division lemma to 1240 and 797, to get
1240 = 797 x 1 + 443
Step 2: Since the reminder 797 ≠ 0, we apply division lemma to 443 and 797, to get
797 = 443 x 1 + 354
Step 3: We consider the new divisor 443 and the new remainder 354, and apply the division lemma to get
443 = 354 x 1 + 89
We consider the new divisor 354 and the new remainder 89,and apply the division lemma to get
354 = 89 x 3 + 87
We consider the new divisor 89 and the new remainder 87,and apply the division lemma to get
89 = 87 x 1 + 2
We consider the new divisor 87 and the new remainder 2,and apply the division lemma to get
87 = 2 x 43 + 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 797 and 1240 is 1
Notice that 1 = HCF(2,1) = HCF(87,2) = HCF(89,87) = HCF(354,89) = HCF(443,354) = HCF(797,443) = HCF(1240,797) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 797, 1240 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 797, 1240?
Answer: HCF of 797, 1240 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 797, 1240 using Euclid's Algorithm?
Answer: For arbitrary numbers 797, 1240 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.