Highest Common Factor of 7791, 5789, 89914 using Euclid's algorithm
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 7791, 5789, 89914 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 7791, 5789, 89914 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 7791, 5789, 89914 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 7791, 5789, 89914 is 1.
HCF(7791, 5789, 89914) = 1
HCF of 7791, 5789, 89914 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 7791, 5789, 89914 is 1.
Highest Common Factor of 7791,5789,89914 is 1
Step 1: Since 7791 > 5789, we apply the division lemma to 7791 and 5789, to get
7791 = 5789 x 1 + 2002
Step 2: Since the reminder 5789 ≠ 0, we apply division lemma to 2002 and 5789, to get
5789 = 2002 x 2 + 1785
Step 3: We consider the new divisor 2002 and the new remainder 1785, and apply the division lemma to get
2002 = 1785 x 1 + 217
We consider the new divisor 1785 and the new remainder 217,and apply the division lemma to get
1785 = 217 x 8 + 49
We consider the new divisor 217 and the new remainder 49,and apply the division lemma to get
217 = 49 x 4 + 21
We consider the new divisor 49 and the new remainder 21,and apply the division lemma to get
49 = 21 x 2 + 7
We consider the new divisor 21 and the new remainder 7,and apply the division lemma to get
21 = 7 x 3 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 7, the HCF of 7791 and 5789 is 7
Notice that 7 = HCF(21,7) = HCF(49,21) = HCF(217,49) = HCF(1785,217) = HCF(2002,1785) = HCF(5789,2002) = HCF(7791,5789) .
We can take hcf of as 1st numbers and next number as another number to apply in Euclidean lemma
Step 1: Since 89914 > 7, we apply the division lemma to 89914 and 7, to get
89914 = 7 x 12844 + 6
Step 2: Since the reminder 7 ≠ 0, we apply division lemma to 6 and 7, to get
7 = 6 x 1 + 1
Step 3: We consider the new divisor 6 and the new remainder 1, and apply the division lemma to get
6 = 1 x 6 + 0
The remainder has now become zero, so our procedure stops. Since the divisor at this stage is 1, the HCF of 7 and 89914 is 1
Notice that 1 = HCF(6,1) = HCF(7,6) = HCF(89914,7) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 7791, 5789, 89914 using Euclid's Algorithm
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 7791, 5789, 89914?
Answer: HCF of 7791, 5789, 89914 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 7791, 5789, 89914 using Euclid's Algorithm?
Answer: For arbitrary numbers 7791, 5789, 89914 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.