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