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