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