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