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