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