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