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