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