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