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