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