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