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