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