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