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