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