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