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