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