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