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 8736, 5391 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 8736, 5391 is 3 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 8736, 5391 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 8736, 5391 is 3.
HCF(8736, 5391) = 3
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 8736, 5391 is 3.
Step 1: Since 8736 > 5391, we apply the division lemma to 8736 and 5391, to get
8736 = 5391 x 1 + 3345
Step 2: Since the reminder 5391 ≠ 0, we apply division lemma to 3345 and 5391, to get
5391 = 3345 x 1 + 2046
Step 3: We consider the new divisor 3345 and the new remainder 2046, and apply the division lemma to get
3345 = 2046 x 1 + 1299
We consider the new divisor 2046 and the new remainder 1299,and apply the division lemma to get
2046 = 1299 x 1 + 747
We consider the new divisor 1299 and the new remainder 747,and apply the division lemma to get
1299 = 747 x 1 + 552
We consider the new divisor 747 and the new remainder 552,and apply the division lemma to get
747 = 552 x 1 + 195
We consider the new divisor 552 and the new remainder 195,and apply the division lemma to get
552 = 195 x 2 + 162
We consider the new divisor 195 and the new remainder 162,and apply the division lemma to get
195 = 162 x 1 + 33
We consider the new divisor 162 and the new remainder 33,and apply the division lemma to get
162 = 33 x 4 + 30
We consider the new divisor 33 and the new remainder 30,and apply the division lemma to get
33 = 30 x 1 + 3
We consider the new divisor 30 and the new remainder 3,and apply the division lemma to get
30 = 3 x 10 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 3, the HCF of 8736 and 5391 is 3
Notice that 3 = HCF(30,3) = HCF(33,30) = HCF(162,33) = HCF(195,162) = HCF(552,195) = HCF(747,552) = HCF(1299,747) = HCF(2046,1299) = HCF(3345,2046) = HCF(5391,3345) = HCF(8736,5391) .
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 8736, 5391?
Answer: HCF of 8736, 5391 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 8736, 5391 using Euclid's Algorithm?
Answer: For arbitrary numbers 8736, 5391 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.