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