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