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