Highest Common Factor of 2789, 2184 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 2789, 2184 i.e. 1 the largest integer that leaves a remainder zero for all numbers.
HCF of 2789, 2184 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 2789, 2184 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 2789, 2184 is 1.
HCF(2789, 2184) = 1
HCF of 2789, 2184 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 2789, 2184 is 1.
Highest Common Factor of 2789,2184 is 1
Step 1: Since 2789 > 2184, we apply the division lemma to 2789 and 2184, to get
2789 = 2184 x 1 + 605
Step 2: Since the reminder 2184 ≠ 0, we apply division lemma to 605 and 2184, to get
2184 = 605 x 3 + 369
Step 3: We consider the new divisor 605 and the new remainder 369, and apply the division lemma to get
605 = 369 x 1 + 236
We consider the new divisor 369 and the new remainder 236,and apply the division lemma to get
369 = 236 x 1 + 133
We consider the new divisor 236 and the new remainder 133,and apply the division lemma to get
236 = 133 x 1 + 103
We consider the new divisor 133 and the new remainder 103,and apply the division lemma to get
133 = 103 x 1 + 30
We consider the new divisor 103 and the new remainder 30,and apply the division lemma to get
103 = 30 x 3 + 13
We consider the new divisor 30 and the new remainder 13,and apply the division lemma to get
30 = 13 x 2 + 4
We consider the new divisor 13 and the new remainder 4,and apply the division lemma to get
13 = 4 x 3 + 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 2789 and 2184 is 1
Notice that 1 = HCF(4,1) = HCF(13,4) = HCF(30,13) = HCF(103,30) = HCF(133,103) = HCF(236,133) = HCF(369,236) = HCF(605,369) = HCF(2184,605) = HCF(2789,2184) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 2789, 2184 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 2789, 2184?
Answer: HCF of 2789, 2184 is 1 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 2789, 2184 using Euclid's Algorithm?
Answer: For arbitrary numbers 2789, 2184 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.
