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