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