Highest Common Factor of 9012, 6552 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 9012, 6552 i.e. 12 the largest integer that leaves a remainder zero for all numbers.
HCF of 9012, 6552 is 12 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 9012, 6552 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 9012, 6552 is 12.
HCF(9012, 6552) = 12
HCF of 9012, 6552 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9012, 6552 is 12.
Highest Common Factor of 9012,6552 is 12
Step 1: Since 9012 > 6552, we apply the division lemma to 9012 and 6552, to get
9012 = 6552 x 1 + 2460
Step 2: Since the reminder 6552 ≠ 0, we apply division lemma to 2460 and 6552, to get
6552 = 2460 x 2 + 1632
Step 3: We consider the new divisor 2460 and the new remainder 1632, and apply the division lemma to get
2460 = 1632 x 1 + 828
We consider the new divisor 1632 and the new remainder 828,and apply the division lemma to get
1632 = 828 x 1 + 804
We consider the new divisor 828 and the new remainder 804,and apply the division lemma to get
828 = 804 x 1 + 24
We consider the new divisor 804 and the new remainder 24,and apply the division lemma to get
804 = 24 x 33 + 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 9012 and 6552 is 12
Notice that 12 = HCF(24,12) = HCF(804,24) = HCF(828,804) = HCF(1632,828) = HCF(2460,1632) = HCF(6552,2460) = HCF(9012,6552) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 9012, 6552 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 9012, 6552?
Answer: HCF of 9012, 6552 is 12 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9012, 6552 using Euclid's Algorithm?
Answer: For arbitrary numbers 9012, 6552 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.