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