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