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