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