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