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