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