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