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