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