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