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