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