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