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