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