Highest Common Factor of 858, 518, 366 using Euclid's algorithm
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 858, 518, 366 i.e. 2 the largest integer that leaves a remainder zero for all numbers.
HCF of 858, 518, 366 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 858, 518, 366 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 858, 518, 366 is 2.
HCF(858, 518, 366) = 2
HCF of 858, 518, 366 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 858, 518, 366 is 2.
Highest Common Factor of 858,518,366 is 2
Step 1: Since 858 > 518, we apply the division lemma to 858 and 518, to get
858 = 518 x 1 + 340
Step 2: Since the reminder 518 ≠ 0, we apply division lemma to 340 and 518, to get
518 = 340 x 1 + 178
Step 3: We consider the new divisor 340 and the new remainder 178, and apply the division lemma to get
340 = 178 x 1 + 162
We consider the new divisor 178 and the new remainder 162,and apply the division lemma to get
178 = 162 x 1 + 16
We consider the new divisor 162 and the new remainder 16,and apply the division lemma to get
162 = 16 x 10 + 2
We consider the new divisor 16 and the new remainder 2,and apply the division lemma to get
16 = 2 x 8 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 858 and 518 is 2
Notice that 2 = HCF(16,2) = HCF(162,16) = HCF(178,162) = HCF(340,178) = HCF(518,340) = HCF(858,518) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 366 > 2, we apply the division lemma to 366 and 2, to get
366 = 2 x 183 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 2, the HCF of 2 and 366 is 2
Notice that 2 = HCF(366,2) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 858, 518, 366 using Euclid's Algorithm
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 858, 518, 366?
Answer: HCF of 858, 518, 366 is 2 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 858, 518, 366 using Euclid's Algorithm?
Answer: For arbitrary numbers 858, 518, 366 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.