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