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