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