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