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