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