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