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