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