Highest Common Factor of 9891, 1146 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 9891, 1146 i.e. 3 the largest integer that leaves a remainder zero for all numbers.
HCF of 9891, 1146 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 9891, 1146 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 9891, 1146 is 3.
HCF(9891, 1146) = 3
HCF of 9891, 1146 using Euclid's algorithm
Highest common factor or Highest common divisor (hcd) can be calculated by Euclid's algotithm.
Highest common factor (HCF) of 9891, 1146 is 3.
Highest Common Factor of 9891,1146 is 3
Step 1: Since 9891 > 1146, we apply the division lemma to 9891 and 1146, to get
9891 = 1146 x 8 + 723
Step 2: Since the reminder 1146 ≠ 0, we apply division lemma to 723 and 1146, to get
1146 = 723 x 1 + 423
Step 3: We consider the new divisor 723 and the new remainder 423, and apply the division lemma to get
723 = 423 x 1 + 300
We consider the new divisor 423 and the new remainder 300,and apply the division lemma to get
423 = 300 x 1 + 123
We consider the new divisor 300 and the new remainder 123,and apply the division lemma to get
300 = 123 x 2 + 54
We consider the new divisor 123 and the new remainder 54,and apply the division lemma to get
123 = 54 x 2 + 15
We consider the new divisor 54 and the new remainder 15,and apply the division lemma to get
54 = 15 x 3 + 9
We consider the new divisor 15 and the new remainder 9,and apply the division lemma to get
15 = 9 x 1 + 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 9891 and 1146 is 3
Notice that 3 = HCF(6,3) = HCF(9,6) = HCF(15,9) = HCF(54,15) = HCF(123,54) = HCF(300,123) = HCF(423,300) = HCF(723,423) = HCF(1146,723) = HCF(9891,1146) .
HCF using Euclid's Algorithm Calculation Examples
Here are some samples of HCF using Euclid's Algorithm calculations.
Frequently Asked Questions on HCF of 9891, 1146 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 9891, 1146?
Answer: HCF of 9891, 1146 is 3 the largest number that divides all the numbers leaving a remainder zero.
3. How to find HCF of 9891, 1146 using Euclid's Algorithm?
Answer: For arbitrary numbers 9891, 1146 apply Euclid’s Division Lemma in succession until you obtain a remainder zero. HCF is the remainder in the last but one step.