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