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