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