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