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