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