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