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