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