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