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