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