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