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