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