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