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