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